#include "friend.h"
#include<algorithm>
using namespace std;
int d[100010][2];
// Find out best sample
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;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]);
}
if(protocol[i]==1)
{
d[host[i]][0]=max(d[host[i]][1]+d[i][0],d[host[i]][0]+max(d[i][0],d[i][1]));
d[host[i]][1]+=d[i][1];
}
if(protocol[i]==2)
{
d[host[i]][0]=max(d[host[i]][1]+d[i][0],d[i][1]+d[host[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 |
28 ms |
3040 KB |
Output is correct |
13 |
Correct |
16 ms |
3040 KB |
Output is correct |
14 |
Correct |
24 ms |
3040 KB |
Output is correct |
15 |
Correct |
32 ms |
3040 KB |
Output is correct |