73072024-01-06 17:25:22anonTitkos sorozatcpp17Accepted 40/4037ms16784 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, v, cntr, N;
    cin >> N;
    vector<ll> B(N + 1);
    for(i = 1; i <= N; i++)
        cin >> B[i];
    vector<vector<ll>> graph(N + 1);
    for(i = 1; i <= N; i++)
        graph[B[i] == -1 ? 0 : B[i]].push_back(i);
    cntr = N;
    vector<ll> A(N + 1);
    queue<ll> q;
    q.push(0);
    while(!q.empty()) {
        v = q.front();
        q.pop();
        for(const auto &x : graph[v]) {
            A[x] = cntr--;
            q.push(x);
        }
    }
    for(i = 1; i <= N; i++)
        cout << A[i] << ' ';
    cout << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1824 KiB
2Accepted0/018ms7792 KiB
3Accepted1/13ms2296 KiB
4Accepted1/13ms2504 KiB
5Accepted2/23ms2588 KiB
6Accepted1/13ms2728 KiB
7Accepted1/13ms2796 KiB
8Accepted2/23ms3064 KiB
9Accepted2/237ms14740 KiB
10Accepted2/235ms14992 KiB
11Accepted2/235ms14604 KiB
12Accepted2/235ms14812 KiB
13Accepted2/235ms15024 KiB
14Accepted2/235ms15256 KiB
15Accepted2/235ms15572 KiB
16Accepted3/335ms15860 KiB
17Accepted3/335ms15824 KiB
18Accepted3/335ms15888 KiB
19Accepted3/335ms15948 KiB
20Accepted3/334ms16784 KiB
21Accepted1/134ms16288 KiB
22Accepted1/132ms16196 KiB
23Accepted1/134ms16428 KiB