QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #448080 | #5455. TreeScript | ship2077 | WA | 4ms | 5868kb | C++17 | 650b | 2024-06-19 10:54:45 | 2024-06-19 10:54:46 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
constexpr int M=2e5+5;
int n,mx1[M],mx2[M],fa[M];
int read(){
int x=0;char ch=getchar();
while (!isdigit(ch)) ch=getchar();
while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
return x;
}
void solve(){ n=read();
for (int i=1;i<=n;i++) mx1[i]=mx2[i]=0;
for (int i=1;i<=n;i++) fa[i]=read();
for (int i=n;i;i--){
const int mx=mx2[i]+1;
if (i==1) {printf("%d\n",mx);continue;}
if (mx1[fa[i]]<mx) mx2[fa[i]]=mx1[fa[i]],mx1[fa[i]]=mx;
else if (mx2[fa[i]]<mx) mx2[fa[i]]=mx;
}
}
int main(){int T=read();while (T--) solve();return 0;}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5868kb
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: 4ms
memory: 3792kb
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:
3 4 3 3 3 4 4 3 4 3 2 3 3 5 3 4 3 4 1 4 5 1 4 4 5 3 5 3 4 4 2 3 4 2 4 4 3 2 2 4 3 4 1 3 3 3 5 4 4 3 4 2 2 5 4 4 3 4 3 4 3 3 3 4 2 3 3 3 5 4 3 4 4 3 4 4 2 3 3 1 1 5 2 3 3 3 4 5 4 4 3 4 4 3 3 3 3 1 4 4 4 4 3 5 4 3 3 3 4 3 3 3 2 3 4 3 3 2 3 2 3 5 3 4 3 3 4 4 4 4 5 3 4 4 4 2 5 3 4 3 2 3 2 2 5 4 3 2 4 4 ...
result:
wrong answer 1st numbers differ - expected: '4', found: '3'