#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int f[N][2];
int findSample(int n, int confidence[], int host[], int protocol[]) {
for (int i = 0; i < n; ++i) {
f[i][1] = confidence[i];
}
for (int i = n - 1; i >= 1; --i) {
if (protocol[i] == 0) {
f[host[i]][0] += max(f[i][0], f[i][1]);
f[host[i]][1] += f[i][0];
}
if (protocol[i] == 1) {
f[host[i]][1] = max(f[host[i]][1] + max(f[i][0], f[i][1]), f[host[i]][0] + f[i][1]);
f[host[i]][0] += f[i][0];
}
if (protocol[i] == 2) {
f[host[i]][1] = max(f[host[i]][0] + f[i][1], f[host[i]][1] + f[i][0]);
f[host[i]][0] += f[i][0];
}
}
return max(f[0][0], f[0][1]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
492 KB |
Output is correct |
3 |
Correct |
2 ms |
492 KB |
Output is correct |
4 |
Correct |
2 ms |
544 KB |
Output is correct |
5 |
Correct |
2 ms |
544 KB |
Output is correct |
6 |
Correct |
2 ms |
612 KB |
Output is correct |
7 |
Correct |
2 ms |
612 KB |
Output is correct |
8 |
Correct |
2 ms |
612 KB |
Output is correct |
9 |
Correct |
3 ms |
612 KB |
Output is correct |
10 |
Correct |
3 ms |
612 KB |
Output is correct |
11 |
Correct |
3 ms |
612 KB |
Output is correct |
12 |
Correct |
4 ms |
636 KB |
Output is correct |
13 |
Correct |
2 ms |
636 KB |
Output is correct |
14 |
Correct |
4 ms |
752 KB |
Output is correct |
15 |
Correct |
3 ms |
752 KB |
Output is correct |
16 |
Correct |
3 ms |
752 KB |
Output is correct |
17 |
Correct |
2 ms |
752 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
752 KB |
Output is correct |
2 |
Correct |
2 ms |
752 KB |
Output is correct |
3 |
Correct |
4 ms |
752 KB |
Output is correct |
4 |
Correct |
3 ms |
752 KB |
Output is correct |
5 |
Correct |
3 ms |
752 KB |
Output is correct |
6 |
Correct |
3 ms |
752 KB |
Output is correct |
7 |
Correct |
4 ms |
752 KB |
Output is correct |
8 |
Correct |
3 ms |
752 KB |
Output is correct |
9 |
Correct |
3 ms |
752 KB |
Output is correct |
10 |
Correct |
2 ms |
752 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
752 KB |
Output is correct |
2 |
Correct |
4 ms |
772 KB |
Output is correct |
3 |
Correct |
3 ms |
784 KB |
Output is correct |
4 |
Correct |
4 ms |
852 KB |
Output is correct |
5 |
Correct |
3 ms |
852 KB |
Output is correct |
6 |
Correct |
3 ms |
856 KB |
Output is correct |
7 |
Correct |
3 ms |
856 KB |
Output is correct |
8 |
Correct |
3 ms |
856 KB |
Output is correct |
9 |
Correct |
3 ms |
856 KB |
Output is correct |
10 |
Correct |
3 ms |
856 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
856 KB |
Output is correct |
2 |
Correct |
3 ms |
856 KB |
Output is correct |
3 |
Correct |
2 ms |
856 KB |
Output is correct |
4 |
Correct |
2 ms |
856 KB |
Output is correct |
5 |
Correct |
4 ms |
856 KB |
Output is correct |
6 |
Correct |
3 ms |
948 KB |
Output is correct |
7 |
Correct |
2 ms |
948 KB |
Output is correct |
8 |
Correct |
3 ms |
948 KB |
Output is correct |
9 |
Correct |
0 ms |
948 KB |
Output is correct |
10 |
Correct |
2 ms |
948 KB |
Output is correct |
11 |
Correct |
2 ms |
948 KB |
Output is correct |
12 |
Correct |
2 ms |
948 KB |
Output is correct |
13 |
Correct |
2 ms |
948 KB |
Output is correct |
14 |
Correct |
2 ms |
948 KB |
Output is correct |
15 |
Correct |
3 ms |
948 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
948 KB |
Output is correct |
2 |
Correct |
2 ms |
948 KB |
Output is correct |
3 |
Correct |
2 ms |
948 KB |
Output is correct |
4 |
Correct |
2 ms |
948 KB |
Output is correct |
5 |
Correct |
2 ms |
948 KB |
Output is correct |
6 |
Correct |
2 ms |
948 KB |
Output is correct |
7 |
Correct |
2 ms |
948 KB |
Output is correct |
8 |
Correct |
2 ms |
948 KB |
Output is correct |
9 |
Correct |
3 ms |
948 KB |
Output is correct |
10 |
Correct |
3 ms |
948 KB |
Output is correct |
11 |
Correct |
2 ms |
948 KB |
Output is correct |
12 |
Correct |
3 ms |
948 KB |
Output is correct |
13 |
Correct |
3 ms |
968 KB |
Output is correct |
14 |
Correct |
2 ms |
968 KB |
Output is correct |
15 |
Correct |
3 ms |
968 KB |
Output is correct |
16 |
Correct |
3 ms |
968 KB |
Output is correct |
17 |
Correct |
2 ms |
968 KB |
Output is correct |
18 |
Correct |
3 ms |
968 KB |
Output is correct |
19 |
Correct |
2 ms |
968 KB |
Output is correct |
20 |
Correct |
2 ms |
968 KB |
Output is correct |
21 |
Correct |
3 ms |
968 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
968 KB |
Output is correct |
2 |
Correct |
2 ms |
968 KB |
Output is correct |
3 |
Correct |
3 ms |
968 KB |
Output is correct |
4 |
Correct |
2 ms |
968 KB |
Output is correct |
5 |
Correct |
3 ms |
968 KB |
Output is correct |
6 |
Correct |
2 ms |
968 KB |
Output is correct |
7 |
Correct |
2 ms |
968 KB |
Output is correct |
8 |
Correct |
3 ms |
968 KB |
Output is correct |
9 |
Correct |
2 ms |
968 KB |
Output is correct |
10 |
Correct |
3 ms |
968 KB |
Output is correct |
11 |
Correct |
2 ms |
968 KB |
Output is correct |
12 |
Correct |
38 ms |
2828 KB |
Output is correct |
13 |
Correct |
26 ms |
2828 KB |
Output is correct |
14 |
Correct |
34 ms |
4352 KB |
Output is correct |
15 |
Correct |
35 ms |
5456 KB |
Output is correct |