72802024-01-05 21:22:32anonTitkos sorozatcpp17Wrong answer 0/4021ms5224 KiB
#include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long long ll;
int main() {
    FastIO;
    ll i, j, lo, hi, decr, N;
    cin >> N;
    vector<ll> B(N);
    for(i = 0; i < N; i++)
        cin >> B[i];
    lo = 0;
    hi = N + 1;
    for(i = 0; i < N; i++) {
        if(B[i] == -1)
            cout << --hi << ' ';
        else {
            lo += B[i] - i - 1;
            decr = lo;
            for(j = i; j < B[i] - 1; j++)
                cout << decr-- << ' ';
            i = j - 1;
        }
    }
    cout << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/03ms1828 KiB
2Wrong answer0/012ms2888 KiB
3Wrong answer0/13ms2228 KiB
4Wrong answer0/13ms2460 KiB
5Wrong answer0/22ms2552 KiB
6Wrong answer0/13ms2824 KiB
7Wrong answer0/13ms3008 KiB
8Wrong answer0/23ms3092 KiB
9Wrong answer0/221ms4352 KiB
10Wrong answer0/221ms4588 KiB
11Wrong answer0/221ms4576 KiB
12Wrong answer0/221ms4584 KiB
13Wrong answer0/221ms4584 KiB
14Wrong answer0/221ms4572 KiB
15Wrong answer0/221ms4784 KiB
16Wrong answer0/321ms4792 KiB
17Wrong answer0/321ms5000 KiB
18Wrong answer0/321ms5008 KiB
19Wrong answer0/321ms5004 KiB
20Wrong answer0/321ms5012 KiB
21Wrong answer0/121ms4996 KiB
22Wrong answer0/121ms5224 KiB
23Wrong answer0/121ms5220 KiB