#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int p[maxn], q[maxn];
int findSample(int n,int confidence[],int host[],int protocol[]){
for(int x=0;x<n;x++) p[x] = confidence[x], q[x] = 0;
for(int x=n-1;x>0;x--) {
int y = host[x];
if(protocol[x]==0) {
p[y] = p[y] + q[x];
q[y] = q[y] + max(p[x], q[x]);
}
else if(protocol[x]==1) {
p[y] = max(p[y] + max(p[x], q[x]), p[x] + q[y]);
q[y] = q[y] + q[x];
}
else {
p[y] = max(p[y] + q[x], p[x] + q[y]);
q[y] = q[y] + q[x];
}
}
return max(p[0], q[0]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3968 KB |
Output is correct |
2 |
Correct |
0 ms |
3968 KB |
Output is correct |
3 |
Correct |
0 ms |
3968 KB |
Output is correct |
4 |
Correct |
0 ms |
3968 KB |
Output is correct |
5 |
Correct |
0 ms |
3968 KB |
Output is correct |
6 |
Correct |
0 ms |
3968 KB |
Output is correct |
7 |
Correct |
0 ms |
3968 KB |
Output is correct |
8 |
Correct |
0 ms |
3968 KB |
Output is correct |
9 |
Correct |
0 ms |
3968 KB |
Output is correct |
10 |
Correct |
0 ms |
3968 KB |
Output is correct |
11 |
Correct |
0 ms |
3968 KB |
Output is correct |
12 |
Correct |
0 ms |
3968 KB |
Output is correct |
13 |
Correct |
0 ms |
3968 KB |
Output is correct |
14 |
Correct |
0 ms |
3968 KB |
Output is correct |
15 |
Correct |
0 ms |
3968 KB |
Output is correct |
16 |
Correct |
0 ms |
3968 KB |
Output is correct |
17 |
Correct |
0 ms |
3968 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3968 KB |
Output is correct |
2 |
Correct |
0 ms |
3968 KB |
Output is correct |
3 |
Correct |
0 ms |
3968 KB |
Output is correct |
4 |
Correct |
0 ms |
3968 KB |
Output is correct |
5 |
Correct |
0 ms |
3968 KB |
Output is correct |
6 |
Correct |
0 ms |
3968 KB |
Output is correct |
7 |
Correct |
0 ms |
3968 KB |
Output is correct |
8 |
Correct |
0 ms |
3968 KB |
Output is correct |
9 |
Correct |
0 ms |
3968 KB |
Output is correct |
10 |
Correct |
0 ms |
3968 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3968 KB |
Output is correct |
2 |
Correct |
0 ms |
3968 KB |
Output is correct |
3 |
Correct |
0 ms |
3968 KB |
Output is correct |
4 |
Correct |
0 ms |
3968 KB |
Output is correct |
5 |
Correct |
0 ms |
3968 KB |
Output is correct |
6 |
Correct |
0 ms |
3968 KB |
Output is correct |
7 |
Correct |
0 ms |
3968 KB |
Output is correct |
8 |
Correct |
0 ms |
3968 KB |
Output is correct |
9 |
Correct |
0 ms |
3968 KB |
Output is correct |
10 |
Correct |
0 ms |
3968 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3968 KB |
Output is correct |
2 |
Correct |
0 ms |
3968 KB |
Output is correct |
3 |
Correct |
0 ms |
3968 KB |
Output is correct |
4 |
Correct |
0 ms |
3968 KB |
Output is correct |
5 |
Correct |
0 ms |
3968 KB |
Output is correct |
6 |
Correct |
0 ms |
3968 KB |
Output is correct |
7 |
Correct |
0 ms |
3968 KB |
Output is correct |
8 |
Correct |
0 ms |
3968 KB |
Output is correct |
9 |
Correct |
0 ms |
3968 KB |
Output is correct |
10 |
Correct |
0 ms |
3968 KB |
Output is correct |
11 |
Correct |
0 ms |
3968 KB |
Output is correct |
12 |
Correct |
0 ms |
3968 KB |
Output is correct |
13 |
Correct |
0 ms |
3968 KB |
Output is correct |
14 |
Correct |
0 ms |
3968 KB |
Output is correct |
15 |
Correct |
0 ms |
3968 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3968 KB |
Output is correct |
2 |
Correct |
0 ms |
3968 KB |
Output is correct |
3 |
Correct |
0 ms |
3968 KB |
Output is correct |
4 |
Correct |
0 ms |
3968 KB |
Output is correct |
5 |
Correct |
0 ms |
3968 KB |
Output is correct |
6 |
Correct |
0 ms |
3968 KB |
Output is correct |
7 |
Correct |
0 ms |
3968 KB |
Output is correct |
8 |
Correct |
0 ms |
3968 KB |
Output is correct |
9 |
Correct |
0 ms |
3968 KB |
Output is correct |
10 |
Correct |
0 ms |
3968 KB |
Output is correct |
11 |
Correct |
0 ms |
3968 KB |
Output is correct |
12 |
Correct |
0 ms |
3968 KB |
Output is correct |
13 |
Correct |
0 ms |
3968 KB |
Output is correct |
14 |
Correct |
0 ms |
3968 KB |
Output is correct |
15 |
Correct |
0 ms |
3968 KB |
Output is correct |
16 |
Correct |
0 ms |
3968 KB |
Output is correct |
17 |
Correct |
0 ms |
3968 KB |
Output is correct |
18 |
Correct |
0 ms |
3968 KB |
Output is correct |
19 |
Correct |
0 ms |
3968 KB |
Output is correct |
20 |
Correct |
0 ms |
3968 KB |
Output is correct |
21 |
Correct |
0 ms |
3968 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3968 KB |
Output is correct |
2 |
Correct |
0 ms |
3968 KB |
Output is correct |
3 |
Correct |
0 ms |
3968 KB |
Output is correct |
4 |
Correct |
0 ms |
3968 KB |
Output is correct |
5 |
Correct |
0 ms |
3968 KB |
Output is correct |
6 |
Correct |
0 ms |
3968 KB |
Output is correct |
7 |
Correct |
0 ms |
3968 KB |
Output is correct |
8 |
Correct |
0 ms |
3968 KB |
Output is correct |
9 |
Correct |
0 ms |
3968 KB |
Output is correct |
10 |
Correct |
0 ms |
3968 KB |
Output is correct |
11 |
Correct |
0 ms |
3968 KB |
Output is correct |
12 |
Correct |
39 ms |
3968 KB |
Output is correct |
13 |
Correct |
19 ms |
3968 KB |
Output is correct |
14 |
Correct |
36 ms |
3968 KB |
Output is correct |
15 |
Correct |
36 ms |
3968 KB |
Output is correct |