73062024-01-06 17:13:35anonTitkos sorozatcpp17Accepted 40/4035ms16036 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]) {
            if(A[x])
                continue;
            A[x] = cntr--;
            q.push(x);
        }
    }
    for(i = 1; i <= N; i++)
        cout << A[i] << ' ';
    cout << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1832 KiB
2Accepted0/017ms7780 KiB
3Accepted1/13ms2236 KiB
4Accepted1/13ms2448 KiB
5Accepted2/23ms2664 KiB
6Accepted1/13ms2812 KiB
7Accepted1/13ms3064 KiB
8Accepted2/23ms3016 KiB
9Accepted2/235ms14744 KiB
10Accepted2/235ms15008 KiB
11Accepted2/235ms14600 KiB
12Accepted2/235ms14712 KiB
13Accepted2/235ms14716 KiB
14Accepted2/234ms14752 KiB
15Accepted2/235ms15268 KiB
16Accepted3/334ms15372 KiB
17Accepted3/335ms15328 KiB
18Accepted3/335ms15360 KiB
19Accepted3/334ms15492 KiB
20Accepted3/335ms16036 KiB
21Accepted1/134ms15556 KiB
22Accepted1/134ms15492 KiB
23Accepted1/134ms15828 KiB