21922022-12-30 22:02:16hunor496Titkos sorozatcpp17Wrong answer 0/4046ms5648 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++) {
		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/03ms1808 KiB
2Wrong answer0/024ms2712 KiB
3Wrong answer0/12ms2212 KiB
4Wrong answer0/12ms2312 KiB
5Wrong answer0/22ms2528 KiB
6Wrong answer0/12ms2740 KiB
7Wrong answer0/12ms2940 KiB
8Wrong answer0/22ms3172 KiB
9Wrong answer0/245ms4556 KiB
10Wrong answer0/246ms4748 KiB
11Wrong answer0/246ms4760 KiB
12Wrong answer0/246ms4836 KiB
13Wrong answer0/246ms4964 KiB
14Wrong answer0/245ms5296 KiB
15Wrong answer0/246ms5244 KiB
16Wrong answer0/345ms5248 KiB
17Wrong answer0/346ms5364 KiB
18Wrong answer0/345ms5440 KiB
19Wrong answer0/345ms5436 KiB
20Wrong answer0/346ms5580 KiB
21Wrong answer0/143ms5648 KiB
22Wrong answer0/143ms5644 KiB
23Wrong answer0/143ms5576 KiB