21912022-12-30 21:52:31hunor496Titkos sorozatcpp17Wrong answer 0/40939ms4524 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int> sor(n);
	for (int i = 0; i < n; i++) {
		cin >> sor[i];
	}
	int legk = 1;
	int legn = n;
	vector<int> mo(n);
	for (int i = 0; i < n; i++) {
		cerr << legk << " " << " " << sor[i] << " " << i << "\n";
		if (sor[i] == -1) {
			mo[i] = legn;
			legn--;
		} else {
			mo[i] = legk + sor[i] - i - 2;
			if (mo[i] == legk) {
				legk++;
			}
		}
		cout << mo[i] << " ";
	}
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/03ms1816 KiB
2Wrong answer0/0666ms2708 KiB
3Wrong answer0/14ms2208 KiB
4Wrong answer0/14ms2408 KiB
5Wrong answer0/24ms2664 KiB
6Wrong answer0/116ms2868 KiB
7Wrong answer0/117ms3068 KiB
8Wrong answer0/214ms3384 KiB
9Time limit exceeded0/2899ms3488 KiB
10Time limit exceeded0/2860ms3716 KiB
11Time limit exceeded0/2865ms3896 KiB
12Time limit exceeded0/2861ms4084 KiB
13Time limit exceeded0/2861ms4176 KiB
14Time limit exceeded0/2864ms4304 KiB
15Time limit exceeded0/2939ms4324 KiB
16Time limit exceeded0/3867ms4516 KiB
17Time limit exceeded0/3878ms4320 KiB
18Time limit exceeded0/3861ms4524 KiB
19Time limit exceeded0/3856ms4360 KiB
20Time limit exceeded0/3867ms4412 KiB
21Time limit exceeded0/1860ms4520 KiB
22Time limit exceeded0/1864ms4320 KiB
23Time limit exceeded0/1867ms4472 KiB