QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #761429 | #9751. 覆盖一棵树 | syhhh1 | WA | 27ms | 8876kb | C++14 | 608b | 2024-11-18 22:52:19 | 2024-11-18 22:52:22 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+10;
int dep[N];
vector<int>f[N];
void dfs(int u,int fa)
{
dep[u]=dep[fa]+1;
for(auto v:f[u])
{
if(v==fa)continue;
dfs(v,u);
}
}
signed main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
f[i].clear();
dep[i]=0;
}
for(int i=2;i<=n;i++)
{
int x;
cin>>x;
f[i].push_back(x);
f[x].push_back(i);
}
dfs(1,0);
int mx=0;
for(int i=1;i<=n;i++)mx=max(dep[i],mx);
cout<<mx-1<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 8876kb
input:
2 8 1 2 3 2 5 1 7 8 1 2 3 4 5 6 7
output:
3 7
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 27ms
memory: 8260kb
input:
33428 10 1 2 3 3 4 6 7 7 9 10 1 2 3 4 5 6 7 8 8 8 1 2 3 4 5 6 7 8 1 2 3 4 4 6 7 4 1 2 3 3 1 2 3 1 1 9 1 2 3 4 5 6 7 8 2 1 3 1 2 10 1 2 3 4 5 6 7 8 9 3 1 2 2 1 10 1 2 3 4 5 6 7 8 9 2 1 5 1 2 2 4 8 1 2 3 4 5 6 7 5 1 2 3 3 2 1 5 1 2 3 4 3 1 2 9 1 2 3 4 5 6 6 8 9 1 2 3 4 5 6 7 8 9 1 2 3 4 5 5 7 8 8 1 2 ...
output:
7 8 7 6 3 2 1 8 1 2 9 2 1 9 1 3 7 3 1 4 2 7 8 7 6 4 1 2 9 7 4 3 4 6 7 3 5 7 6 5 9 3 4 4 8 2 8 6 2 4 8 4 2 1 5 2 5 2 4 7 2 2 5 2 2 6 3 9 2 5 7 4 2 2 1 3 1 9 1 5 1 7 3 6 2 9 7 2 3 1 3 3 1 2 8 6 8 4 7 7 7 6 5 7 8 4 5 2 5 5 1 7 7 7 2 2 2 3 8 3 5 6 4 3 3 3 2 2 4 8 6 7 8 6 4 2 4 7 8 1 6 2 7 7 9 1 2 8 5 2 ...
result:
wrong answer 1st lines differ - expected: '4', found: '7'