QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #465789 | #9101. Zayin and Bus | grass8cow# | AC ✓ | 119ms | 4712kb | C++17 | 438b | 2024-07-07 09:32:28 | 2024-07-07 09:32:28 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n,a[101010],d[100100];
void sol(){
scanf("%d",&n);
for(int i=2,f;i<=n;i++)
scanf("%d",&f),d[i]=d[f]+1;
sort(d+1,d+n+1);
for(int i=1;i<=n;i++)scanf("%d",&a[i]),a[i]+=i;
sort(a+1,a+n+1);int ans=0;
for(int i=1;i<=n;i++)
ans=max(ans,a[i]+d[n+1-i]);
printf("%d\n",ans);
}
int main(){
int T;scanf("%d",&T);while(T--)sol();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3924kb
input:
14 1 1 1 2 1 3 2 1 1 1 2 1 1 2 2 1 2 1 2 1 1 3 2 1 3 1 2 1 1 4 2 1 4 1 3 1 1 1 1 1 3 1 2 1 1 1 3 1 1 1 3 2 3 1 2 1 3 2
output:
2 3 4 3 4 4 5 4 6 5 4 4 6 6
result:
ok 14 lines
Test #2:
score: 0
Accepted
time: 119ms
memory: 4712kb
input:
15 1000 1 2 2 1 1 1 4 8 1 7 7 7 9 3 4 7 15 18 18 4 6 11 19 7 6 1 9 13 2 21 28 6 17 24 24 2 28 5 32 24 23 8 3 26 15 28 25 34 46 41 33 16 46 11 7 2 13 53 12 59 52 53 51 52 31 41 63 18 55 49 55 62 15 19 23 67 18 37 2 4 23 75 58 55 14 84 20 3 7 89 82 15 53 77 60 25 97 69 5 40 54 24 72 10 87 90 99 43 71 ...
output:
98572828 100088663 99870474 100076153 99995412 100076982 99971239 100079684 99928633 100093408 99432584 100093568 99620300 100058966 99565256
result:
ok 15 lines