提出 #31816545

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
    int N;
    ll L, R;
    cin >> N >> L >> R;
    L -= 1;
    vector<int> A(N);
    iota(begin(A), end(A), 1);
    int x = 0;
    ll cnt = 0;
    while (cnt + (N - x - 1) <= L) {
        cnt += N - x - 1;
        x += 1;
    }
    int y = x + 1;
    while (cnt < L) {
        cnt += 1;
        y += 1;
    }
    while (cnt < R and y < N) {
        swap(A[x], A[y]);
        cnt += 1;
        y += 1;
    }
    x += 1;
    const int memo_x = x;
    while (cnt + (N - x - 1) < R) {
        cnt += N - x - 1;
        x += 1;
    }
    reverse(begin(A) + memo_x, end(A));
    reverse(begin(A) + x, end(A));
    y = x + 1;
    while (cnt < R and y < N) {
        swap(A[x], A[y]);
        cnt += 1;
        y += 1;
    }
    for (int i = 0; i < N; ++i) {
        cout << A[i] << " \n"[i + 1 == N];
    }
    return 0;
}

提出情報

ジャッジ結果