QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #589605 | #8134. LCA Counting | 2020HZ06 | WA | 2ms | 8644kb | C++14 | 513b | 2024-09-25 18:55:04 | 2024-09-25 18:55:05 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>v[200005];
int ans,p,leaf,tot;
void dfs(int u){
int sz=v[u].size();
if(sz==0){
ans++;printf("%d ",ans),tot++;
return;
}
if(sz==1) dfs(v[u][0]);
else{
dfs(v[u][0]),ans++,dfs(v[u][1]);
}
}
int main(){
int x;
scanf("%d",&n);
for(int i=2;i<=n;i++){
scanf("%d",&x);v[x].push_back(i);
}
for(int i=1;i<=n;i++)
if(v[i].size()==0) leaf++;
dfs(1);
for(int i=tot+1;i<=leaf;i++) printf("%d ",++ans);
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 8576kb
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: 8564kb
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: 2ms
memory: 8628kb
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: 2ms
memory: 8636kb
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: 0ms
memory: 8644kb
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 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 10...
result:
wrong answer 6th numbers differ - expected: '10', found: '9'