QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #187376 | #5455. TreeScript | Coke | WA | 10ms | 9840kb | C++14 | 930b | 2023-09-24 16:43:25 | 2023-09-24 16:43:25 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cerr<<#x<<' '<<x<<' ';
typedef pair<int, int>PII;
typedef long long LL;
constexpr int N = 200010, mod = 1e9 + 7;
int a[N];
vector<int>v[N];
int cnt[N];
void dfs(int u,int fa)
{
int f=0;
cnt[u]=0;
for(auto c:v[u])
{
if(c==fa)continue;
f++;
dfs(c,u);
cnt[u]+=cnt[c];
}
if(f>=2)cnt[u]+=1;
}
signed main()
{
//freopen(".in","r",stdin);freopen(".out","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t;
cin >> t;
while(t--)
{
int n;
cin >> n;
for(int i=0;i<=n;i++)v[i].clear();
for(int i = 1; i <= n; i++)
{
int x ;
cin>>x;
v[x].push_back(i);
}
dfs(1,0);
cout<<cnt[1]+1-(v[1].size()>=2)<<endl;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 9752kb
input:
2 3 0 1 2 7 0 1 2 2 1 4 1
output:
1 2
result:
ok 2 number(s): "1 2"
Test #2:
score: -100
Wrong Answer
time: 10ms
memory: 9840kb
input:
1000 197 0 1 1 2 1 4 1 5 8 3 5 1 4 7 12 14 4 7 10 9 12 11 16 10 21 19 22 17 25 13 28 9 5 15 26 26 33 25 15 1 35 6 32 17 37 8 19 43 19 27 29 9 30 6 31 27 35 35 37 13 28 38 57 31 38 8 22 14 33 9 18 62 52 37 10 19 22 60 54 12 38 59 64 65 80 82 28 60 85 78 27 25 71 14 52 6 59 14 87 32 33 41 59 41 88 38 ...
output:
46 37 4 33 13 20 62 84 19 25 33 42 119 84 11 13 52 193 13 73 161 6 48 57 53 30 170 13 26 113 1 104 30 8 80 29 11 14 7 21 33 21 20 5 17 24 93 87 26 24 27 3 23 61 141 44 20 65 22 47 97 68 5 63 44 20 14 38 99 34 33 106 108 28 49 96 2 7 51 1 1 132 101 19 13 16 83 168 42 62 50 70 30 34 15 15 32 15 37 39 ...
result:
wrong answer 1st numbers differ - expected: '4', found: '46'