QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #504564 | #9101. Zayin and Bus | untitledtwo# | AC ✓ | 115ms | 4604kb | C++20 | 658b | 2024-08-04 13:51:16 | 2024-08-04 13:51:31 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int dep[MAXN], a[MAXN];
signed main() {
#ifndef ONLINE_JUDGE
freopen("a.in", "r", stdin);
#endif
int Case;
scanf("%d", &Case);
while (Case --) {
int n;
scanf("%d", &n);
for (int i = 2; i <= n ; ++ i) {
int x;
scanf("%d", &x);
dep[i] = dep[x] + 1;
}
sort(dep + 1, dep + n + 1);
for (int i = 1; i <= n ; ++ i) scanf("%d", &a[i]);
for (int i = 1; i <= n ; ++ i) a[i] += i;
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
int ans = 0;
for (int i = 1; i <= n ; ++ i) ans = max(ans, a[i] + dep[i]);
printf("%d\n", ans);
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3952kb
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: 115ms
memory: 4604kb
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