#include "friend.h"
int D[100000][2];
int MAX(int X, int Y)
{
if(X>Y)
return X;
return Y;
}
int findSample(int n, int confidence[], int host[], int protocol[])
{
int i;
for(i=0 ; i<n ; i++)
D[i][0]=confidence[i];
for(i=n-1 ; i>=1 ; i--)
{
if(protocol[i]==0)
{
D[host[i]][0]+=D[i][1];
D[host[i]][1]+=MAX(D[i][0],D[i][1]);
}
else if(protocol[i]==1)
{
D[host[i]][0]=MAX(D[host[i]][0]+MAX(D[i][0],D[i][1]),D[host[i]][1]+D[i][0]);
D[host[i]][1]+=D[i][1];
}
else
{
D[host[i]][0]=MAX(D[host[i]][0]+D[i][1],D[host[i]][1]+D[i][0]);
D[host[i]][1]+=D[i][1];
}
}
return MAX(D[0][0],D[0][1]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3040 KB |
Output is correct |
2 |
Correct |
0 ms |
3040 KB |
Output is correct |
3 |
Correct |
0 ms |
3040 KB |
Output is correct |
4 |
Correct |
0 ms |
3040 KB |
Output is correct |
5 |
Correct |
0 ms |
3040 KB |
Output is correct |
6 |
Correct |
0 ms |
3040 KB |
Output is correct |
7 |
Correct |
0 ms |
3040 KB |
Output is correct |
8 |
Correct |
0 ms |
3040 KB |
Output is correct |
9 |
Correct |
0 ms |
3040 KB |
Output is correct |
10 |
Correct |
0 ms |
3040 KB |
Output is correct |
11 |
Correct |
0 ms |
3040 KB |
Output is correct |
12 |
Correct |
0 ms |
3040 KB |
Output is correct |
13 |
Correct |
0 ms |
3040 KB |
Output is correct |
14 |
Correct |
0 ms |
3040 KB |
Output is correct |
15 |
Correct |
0 ms |
3040 KB |
Output is correct |
16 |
Correct |
0 ms |
3040 KB |
Output is correct |
17 |
Correct |
0 ms |
3040 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3040 KB |
Output is correct |
2 |
Correct |
0 ms |
3040 KB |
Output is correct |
3 |
Correct |
0 ms |
3040 KB |
Output is correct |
4 |
Correct |
0 ms |
3040 KB |
Output is correct |
5 |
Correct |
0 ms |
3040 KB |
Output is correct |
6 |
Correct |
0 ms |
3040 KB |
Output is correct |
7 |
Correct |
0 ms |
3040 KB |
Output is correct |
8 |
Correct |
0 ms |
3040 KB |
Output is correct |
9 |
Correct |
0 ms |
3040 KB |
Output is correct |
10 |
Correct |
0 ms |
3040 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3040 KB |
Output is correct |
2 |
Correct |
0 ms |
3040 KB |
Output is correct |
3 |
Correct |
0 ms |
3040 KB |
Output is correct |
4 |
Correct |
0 ms |
3040 KB |
Output is correct |
5 |
Correct |
0 ms |
3040 KB |
Output is correct |
6 |
Correct |
0 ms |
3040 KB |
Output is correct |
7 |
Correct |
0 ms |
3040 KB |
Output is correct |
8 |
Correct |
0 ms |
3040 KB |
Output is correct |
9 |
Correct |
0 ms |
3040 KB |
Output is correct |
10 |
Correct |
0 ms |
3040 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3040 KB |
Output is correct |
2 |
Correct |
0 ms |
3040 KB |
Output is correct |
3 |
Correct |
0 ms |
3040 KB |
Output is correct |
4 |
Correct |
0 ms |
3040 KB |
Output is correct |
5 |
Correct |
0 ms |
3040 KB |
Output is correct |
6 |
Correct |
0 ms |
3040 KB |
Output is correct |
7 |
Correct |
0 ms |
3040 KB |
Output is correct |
8 |
Correct |
0 ms |
3040 KB |
Output is correct |
9 |
Correct |
0 ms |
3040 KB |
Output is correct |
10 |
Correct |
0 ms |
3040 KB |
Output is correct |
11 |
Correct |
0 ms |
3040 KB |
Output is correct |
12 |
Correct |
0 ms |
3040 KB |
Output is correct |
13 |
Correct |
0 ms |
3040 KB |
Output is correct |
14 |
Correct |
0 ms |
3040 KB |
Output is correct |
15 |
Correct |
0 ms |
3040 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3040 KB |
Output is correct |
2 |
Correct |
0 ms |
3040 KB |
Output is correct |
3 |
Correct |
0 ms |
3040 KB |
Output is correct |
4 |
Correct |
0 ms |
3040 KB |
Output is correct |
5 |
Correct |
0 ms |
3040 KB |
Output is correct |
6 |
Correct |
0 ms |
3040 KB |
Output is correct |
7 |
Correct |
0 ms |
3040 KB |
Output is correct |
8 |
Correct |
0 ms |
3040 KB |
Output is correct |
9 |
Correct |
0 ms |
3040 KB |
Output is correct |
10 |
Correct |
0 ms |
3040 KB |
Output is correct |
11 |
Correct |
0 ms |
3040 KB |
Output is correct |
12 |
Correct |
0 ms |
3040 KB |
Output is correct |
13 |
Correct |
0 ms |
3040 KB |
Output is correct |
14 |
Correct |
0 ms |
3040 KB |
Output is correct |
15 |
Correct |
0 ms |
3040 KB |
Output is correct |
16 |
Correct |
0 ms |
3040 KB |
Output is correct |
17 |
Correct |
0 ms |
3040 KB |
Output is correct |
18 |
Correct |
0 ms |
3040 KB |
Output is correct |
19 |
Correct |
0 ms |
3040 KB |
Output is correct |
20 |
Correct |
0 ms |
3040 KB |
Output is correct |
21 |
Correct |
0 ms |
3040 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3040 KB |
Output is correct |
2 |
Correct |
0 ms |
3040 KB |
Output is correct |
3 |
Correct |
0 ms |
3040 KB |
Output is correct |
4 |
Correct |
0 ms |
3040 KB |
Output is correct |
5 |
Correct |
0 ms |
3040 KB |
Output is correct |
6 |
Correct |
0 ms |
3040 KB |
Output is correct |
7 |
Correct |
0 ms |
3040 KB |
Output is correct |
8 |
Correct |
0 ms |
3040 KB |
Output is correct |
9 |
Correct |
0 ms |
3040 KB |
Output is correct |
10 |
Correct |
0 ms |
3040 KB |
Output is correct |
11 |
Correct |
0 ms |
3040 KB |
Output is correct |
12 |
Correct |
40 ms |
3040 KB |
Output is correct |
13 |
Correct |
12 ms |
3040 KB |
Output is correct |
14 |
Correct |
28 ms |
3040 KB |
Output is correct |
15 |
Correct |
32 ms |
3040 KB |
Output is correct |