QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#348507#8134. LCA Countingucup-team228#WA 1ms3840kbC++171.0kb2024-03-09 19:05:422024-03-09 19:05:43

Judging History

你现在查看的是最新测评结果

  • [2024-03-09 19:05:43]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3840kb
  • [2024-03-09 19:05:42]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    cin >> n;
    vector<int> deg(n), parent(n);
    for (int i = 1; i < n; ++i) {
        int p;
        cin >> p;
        --p;
        parent[i] = p;
        ++deg[p];
    }
    
    int leaf = 0;
    int h = 0;
    vector<int> depth(n);
    depth[0] = (deg[0] >= 2 ? 1 : 0);
    for (int i = 1; i < n; ++i) {
        if (deg[i] == 0) {
            h = max(h, depth[parent[i]]);
            ++leaf;
        } else if (deg[i] >= 2) {
            depth[i] = 1 + depth[parent[i]];
        } else {
            depth[i] = depth[parent[i]];
        }
        //cout << depth[i] << '\n';
    }
    
    //cout << h << '\n';

    int ans = 1;
    cout << "1 ";
    for (int i = 0; i < h; ++i) {
        ans += 2;
        cout << ans << ' ';
    }
    for (int i = h; i < leaf - 1; ++i) {
        ++ans;
        cout << ans << ' ';
    }
    cout << '\n';
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3632kb

input:

7
1 1 2 4 2 2

output:

1 3 5 6 

result:

ok 4 number(s): "1 3 5 6"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3840kb

input:

10
1 1 2 2 1 1 1 2 4

output:

1 3 5 6 7 8 9 

result:

ok 7 numbers

Test #3:

score: 0
Accepted
time: 1ms
memory: 3612kb

input:

10
1 2 2 4 5 6 1 2 4

output:

1 3 5 7 8 

result:

ok 5 number(s): "1 3 5 7 8"

Test #4:

score: 0
Accepted
time: 0ms
memory: 3544kb

input:

10
1 2 3 3 3 5 6 4 9

output:

1 3 4 

result:

ok 3 number(s): "1 3 4"

Test #5:

score: -100
Wrong Answer
time: 1ms
memory: 3608kb

input:

1000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 4 1 2 2 1 1 1 1 2 1 1 1 1 2 2 1 1 1 1 1 6 3 1 1 1 2 2 1 1 2 1 2 1 3 1 2 1 1 2 1 1 1 1 1 1 1 4 1 5 1 1 1 1 1 2 1 1 2 1 2 1 2 5 3 1 3 1 1 2 1 2 1 1 3 2 1 6 2 1 2 5 1 1 1 3 2 1 2 1 1 1 1 1...

output:

1 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 ...

result:

wrong answer 4th numbers differ - expected: '7', found: '6'