QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#569900#9101. Zayin and BusSGColin#AC ✓75ms5036kbC++17854b2024-09-17 12:00:462024-09-17 12:00:47

Judging History

你现在查看的是最新测评结果

  • [2024-09-17 12:00:47]
  • 评测
  • 测评结果:AC
  • 用时:75ms
  • 内存:5036kb
  • [2024-09-17 12:00:46]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

inline ll rd() {
	ll x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

const int N = 100007;

void work() {
	int n = rd();
	vector<int> dep(n, 0), v(n, 0);
	rep(i, 1, n - 1) dep[i] = dep[rd() - 1] + 1;
	rep(i, 1, n) v.eb(i + rd());
	sort(all(dep));
	sort(all(v)); reverse(all(v));
	int ans = 0;
	rep(i, 0, n - 1) ans = max(ans, v[i] + dep[i]);
	printf("%d\n", ans);  
}

int main() {
	per(t, rd(), 1) work();
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3744kb

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: 75ms
memory: 5036kb

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