Submission #3218643

---

Source Code Expand

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <math.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define FOR(i, n, m) for (ll i = (n); i < (m); ++i)
#define FORR(i, n, m) for (ll i = (m) - 1; i >= (n); --i) 
#define FORE(x, xs) for (auto &x: (xs))
#define ALL(v) v.begin(), v.end()
#define ZERO(a) memset(a,0,sizeof(a))

const int INF = 1000000009;
const int MOD = 1000000007;
const double EPS = 1e-14;
const double PI = acos(-1);

const int MAX = 1e5;

int N, A, B;

int judge() {
  if (A+B == N+1) return 1; /// 幅がぴったりの時
  if (A == 1 || B == 1 || A+B > N+1) return -1; /// 幅が足りない、もしくは幅が狭すぎる時
  return 0;
}

int main() {

  cin >> N >> A >> B;
  int j = judge();
  if (j == -1) { /// できなとき
    cout << -1 << endl;
    return 0;
  } else if (j == 1) { /// 単調増加してから単調減少数する
    if (A == 1) {
      cout << N;
      FORR (i, 1, N) cout << " " << i; 
    } else if (B == 1) {
      cout << 1;
      FOR (i, 2, N+1) cout << " " << i;
    } else {
      FOR (i, B, N+1) cout << i << " ";
      FORR (i, 2, B) cout << i << " ";
      cout << 1;
    }
    cout << endl;
    return 0;
  } else {
    int top = N-A+1;
    FOR (i, top, N+1) cout << i << " ";
    int bottom = B-1;
    FORR (i, 1, bottom+1) cout << i << " ";
    while (1) {
      if (top - bottom > 2) cout << --top << " ";
      else {
        cout << top-1 << endl;
        break;
      }
      if (top - bottom > 2) cout << ++bottom << " ";
      else {
        cout << bottom+1 << endl;
        break;
      }
    }
  }


  return 0;

}

Submission Info

Judge Result