#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
const int N = 1e5+10;
int P[N], NP[N];
int findSample(int n, int confidence[], int host[], int protocol[])
{
for (int i = 0; i < n; ++i)
P[i] = confidence[i], NP[i] = 0;
for (int i = n-1; i > 0; --i) {
int &u = P[host[i]];
int &up = NP[host[i]];
int &v = P[i];
int &vp = NP[i];
int nu, nup;
if (protocol[i] == 0) {
nu = u+vp;
nup = up+max(v,vp);
} else if (protocol[i] == 1) {
nu = max(u+v, max(up+v, u+vp));
nup = up+vp;
} else {
nu = max(u+vp, up+v);
nup = up+vp;
}
u = nu, up = nup;
}
return max(P[0], NP[0]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
400 KB |
Output is correct |
4 |
Correct |
2 ms |
480 KB |
Output is correct |
5 |
Correct |
2 ms |
600 KB |
Output is correct |
6 |
Correct |
2 ms |
600 KB |
Output is correct |
7 |
Correct |
3 ms |
680 KB |
Output is correct |
8 |
Correct |
3 ms |
680 KB |
Output is correct |
9 |
Correct |
3 ms |
680 KB |
Output is correct |
10 |
Correct |
2 ms |
680 KB |
Output is correct |
11 |
Correct |
2 ms |
760 KB |
Output is correct |
12 |
Correct |
3 ms |
760 KB |
Output is correct |
13 |
Correct |
3 ms |
760 KB |
Output is correct |
14 |
Correct |
4 ms |
760 KB |
Output is correct |
15 |
Correct |
3 ms |
760 KB |
Output is correct |
16 |
Correct |
2 ms |
760 KB |
Output is correct |
17 |
Correct |
2 ms |
760 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
760 KB |
Output is correct |
2 |
Correct |
4 ms |
760 KB |
Output is correct |
3 |
Correct |
3 ms |
760 KB |
Output is correct |
4 |
Correct |
3 ms |
760 KB |
Output is correct |
5 |
Correct |
3 ms |
760 KB |
Output is correct |
6 |
Correct |
3 ms |
760 KB |
Output is correct |
7 |
Correct |
3 ms |
760 KB |
Output is correct |
8 |
Correct |
5 ms |
760 KB |
Output is correct |
9 |
Correct |
4 ms |
760 KB |
Output is correct |
10 |
Correct |
3 ms |
764 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
772 KB |
Output is correct |
2 |
Correct |
3 ms |
780 KB |
Output is correct |
3 |
Correct |
3 ms |
780 KB |
Output is correct |
4 |
Correct |
4 ms |
796 KB |
Output is correct |
5 |
Correct |
3 ms |
808 KB |
Output is correct |
6 |
Correct |
3 ms |
820 KB |
Output is correct |
7 |
Correct |
3 ms |
824 KB |
Output is correct |
8 |
Correct |
2 ms |
828 KB |
Output is correct |
9 |
Correct |
2 ms |
840 KB |
Output is correct |
10 |
Correct |
4 ms |
840 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
856 KB |
Output is correct |
2 |
Correct |
3 ms |
860 KB |
Output is correct |
3 |
Correct |
2 ms |
864 KB |
Output is correct |
4 |
Correct |
3 ms |
864 KB |
Output is correct |
5 |
Correct |
3 ms |
868 KB |
Output is correct |
6 |
Correct |
4 ms |
880 KB |
Output is correct |
7 |
Correct |
4 ms |
896 KB |
Output is correct |
8 |
Correct |
3 ms |
900 KB |
Output is correct |
9 |
Correct |
2 ms |
912 KB |
Output is correct |
10 |
Correct |
3 ms |
916 KB |
Output is correct |
11 |
Correct |
4 ms |
920 KB |
Output is correct |
12 |
Correct |
4 ms |
920 KB |
Output is correct |
13 |
Correct |
3 ms |
992 KB |
Output is correct |
14 |
Correct |
3 ms |
992 KB |
Output is correct |
15 |
Correct |
4 ms |
992 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
992 KB |
Output is correct |
2 |
Correct |
3 ms |
992 KB |
Output is correct |
3 |
Correct |
4 ms |
992 KB |
Output is correct |
4 |
Correct |
3 ms |
992 KB |
Output is correct |
5 |
Correct |
5 ms |
992 KB |
Output is correct |
6 |
Correct |
2 ms |
992 KB |
Output is correct |
7 |
Correct |
4 ms |
1120 KB |
Output is correct |
8 |
Correct |
3 ms |
1120 KB |
Output is correct |
9 |
Correct |
3 ms |
1120 KB |
Output is correct |
10 |
Correct |
3 ms |
1120 KB |
Output is correct |
11 |
Correct |
3 ms |
1120 KB |
Output is correct |
12 |
Correct |
2 ms |
1120 KB |
Output is correct |
13 |
Correct |
3 ms |
1120 KB |
Output is correct |
14 |
Correct |
2 ms |
1120 KB |
Output is correct |
15 |
Correct |
3 ms |
1120 KB |
Output is correct |
16 |
Correct |
3 ms |
1120 KB |
Output is correct |
17 |
Correct |
3 ms |
1120 KB |
Output is correct |
18 |
Correct |
5 ms |
1120 KB |
Output is correct |
19 |
Correct |
3 ms |
1120 KB |
Output is correct |
20 |
Correct |
4 ms |
1120 KB |
Output is correct |
21 |
Correct |
3 ms |
1120 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1120 KB |
Output is correct |
2 |
Correct |
2 ms |
1120 KB |
Output is correct |
3 |
Correct |
2 ms |
1120 KB |
Output is correct |
4 |
Correct |
2 ms |
1120 KB |
Output is correct |
5 |
Correct |
4 ms |
1120 KB |
Output is correct |
6 |
Correct |
3 ms |
1120 KB |
Output is correct |
7 |
Correct |
2 ms |
1120 KB |
Output is correct |
8 |
Correct |
2 ms |
1120 KB |
Output is correct |
9 |
Correct |
2 ms |
1120 KB |
Output is correct |
10 |
Correct |
2 ms |
1120 KB |
Output is correct |
11 |
Correct |
3 ms |
1120 KB |
Output is correct |
12 |
Correct |
48 ms |
4196 KB |
Output is correct |
13 |
Correct |
28 ms |
4196 KB |
Output is correct |
14 |
Correct |
37 ms |
5756 KB |
Output is correct |
15 |
Correct |
43 ms |
6840 KB |
Output is correct |