제출 #320485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
320485		qpwoeirut	Permutation Recovery (info1cup17_permutation)	C++17	25 / 100	1 ms	640 KiB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MN = 70001;

int N;
ll A[MN];
int pos[MN];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> N;
    for (int i=0; i<N; ++i) {
        cin >> A[i];
    }

    for (int i=N-1; i>0; --i) {
        A[i] -= A[i-1];
    }

    list<int> order;
    for (int i=0; i<N; ++i) {
        ll cur = 1;
        for (auto it=order.begin(); it!=order.end(); ++it) {
            if (cur == A[i]) {
                order.insert(it, i);
                cur = -1;
                break;
            }
            cur += A[*it];
        }
        if (cur == A[i]) {
            order.push_back(i);
            cur = -1;
        }

        assert(cur == -1);
        //cerr << "order:";for (auto it=order.begin(); it!=order.end(); ++it) {cerr << ' ' << *it;} cerr << endl;
    }

    int idx = 0;
    for (auto it=order.begin(); it!=order.end(); ++it) {
        pos[*it] = ++idx;
    }
    for (int i=0; i<N; ++i) {
        if (i) cout << ' ';
        cout << pos[i];
    }
    cout << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 7
• Subtask 7: 0 / 16
• Subtask 8: 0 / 6