#include "friend.h"
#include <algorithm>
using namespace std;
// Find out best sample
int findSample(int n,int cf[],int h[],int pc[]){
int i,c=0;
for(i=n-1;i>0;i--){
if(pc[i]==0){
c+=cf[i];
cf[h[i]]=max(cf[h[i]]-cf[i],0);
}else if(pc[i]==1) cf[h[i]]+=cf[i];
else cf[h[i]]=max(cf[h[i]],cf[i]);
}
return c+cf[0];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2256 KB |
Output is correct |
2 |
Correct |
0 ms |
2256 KB |
Output is correct |
3 |
Correct |
0 ms |
2256 KB |
Output is correct |
4 |
Correct |
0 ms |
2256 KB |
Output is correct |
5 |
Correct |
0 ms |
2256 KB |
Output is correct |
6 |
Correct |
0 ms |
2256 KB |
Output is correct |
7 |
Correct |
0 ms |
2256 KB |
Output is correct |
8 |
Correct |
0 ms |
2256 KB |
Output is correct |
9 |
Correct |
0 ms |
2256 KB |
Output is correct |
10 |
Correct |
0 ms |
2256 KB |
Output is correct |
11 |
Correct |
0 ms |
2256 KB |
Output is correct |
12 |
Correct |
0 ms |
2256 KB |
Output is correct |
13 |
Correct |
0 ms |
2256 KB |
Output is correct |
14 |
Correct |
0 ms |
2256 KB |
Output is correct |
15 |
Correct |
0 ms |
2256 KB |
Output is correct |
16 |
Correct |
0 ms |
2256 KB |
Output is correct |
17 |
Correct |
0 ms |
2256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2256 KB |
Output is correct |
2 |
Correct |
0 ms |
2256 KB |
Output is correct |
3 |
Correct |
0 ms |
2256 KB |
Output is correct |
4 |
Correct |
0 ms |
2256 KB |
Output is correct |
5 |
Correct |
0 ms |
2256 KB |
Output is correct |
6 |
Correct |
0 ms |
2256 KB |
Output is correct |
7 |
Correct |
0 ms |
2256 KB |
Output is correct |
8 |
Correct |
0 ms |
2256 KB |
Output is correct |
9 |
Correct |
0 ms |
2256 KB |
Output is correct |
10 |
Correct |
0 ms |
2256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2256 KB |
Output is correct |
2 |
Correct |
0 ms |
2256 KB |
Output is correct |
3 |
Correct |
0 ms |
2256 KB |
Output is correct |
4 |
Correct |
0 ms |
2256 KB |
Output is correct |
5 |
Correct |
0 ms |
2256 KB |
Output is correct |
6 |
Correct |
0 ms |
2256 KB |
Output is correct |
7 |
Correct |
0 ms |
2256 KB |
Output is correct |
8 |
Correct |
0 ms |
2256 KB |
Output is correct |
9 |
Correct |
0 ms |
2256 KB |
Output is correct |
10 |
Correct |
0 ms |
2256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2256 KB |
Output is correct |
2 |
Correct |
0 ms |
2256 KB |
Output is correct |
3 |
Correct |
0 ms |
2256 KB |
Output is correct |
4 |
Correct |
0 ms |
2256 KB |
Output is correct |
5 |
Correct |
0 ms |
2256 KB |
Output is correct |
6 |
Correct |
0 ms |
2256 KB |
Output is correct |
7 |
Correct |
0 ms |
2256 KB |
Output is correct |
8 |
Correct |
0 ms |
2256 KB |
Output is correct |
9 |
Correct |
0 ms |
2256 KB |
Output is correct |
10 |
Correct |
0 ms |
2256 KB |
Output is correct |
11 |
Correct |
0 ms |
2256 KB |
Output is correct |
12 |
Correct |
0 ms |
2256 KB |
Output is correct |
13 |
Correct |
0 ms |
2256 KB |
Output is correct |
14 |
Correct |
0 ms |
2256 KB |
Output is correct |
15 |
Correct |
1 ms |
2256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2256 KB |
Output is correct |
2 |
Correct |
0 ms |
2256 KB |
Output is correct |
3 |
Correct |
0 ms |
2256 KB |
Output is correct |
4 |
Correct |
0 ms |
2256 KB |
Output is correct |
5 |
Correct |
0 ms |
2256 KB |
Output is correct |
6 |
Correct |
0 ms |
2256 KB |
Output is correct |
7 |
Correct |
0 ms |
2256 KB |
Output is correct |
8 |
Correct |
0 ms |
2256 KB |
Output is correct |
9 |
Correct |
0 ms |
2256 KB |
Output is correct |
10 |
Correct |
0 ms |
2256 KB |
Output is correct |
11 |
Correct |
0 ms |
2256 KB |
Output is correct |
12 |
Correct |
0 ms |
2256 KB |
Output is correct |
13 |
Correct |
0 ms |
2256 KB |
Output is correct |
14 |
Correct |
0 ms |
2256 KB |
Output is correct |
15 |
Correct |
0 ms |
2256 KB |
Output is correct |
16 |
Correct |
0 ms |
2256 KB |
Output is correct |
17 |
Correct |
0 ms |
2256 KB |
Output is correct |
18 |
Correct |
0 ms |
2256 KB |
Output is correct |
19 |
Correct |
0 ms |
2256 KB |
Output is correct |
20 |
Correct |
0 ms |
2256 KB |
Output is correct |
21 |
Correct |
0 ms |
2256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
2256 KB |
Output is correct |
2 |
Correct |
0 ms |
2256 KB |
Output is correct |
3 |
Correct |
0 ms |
2256 KB |
Output is correct |
4 |
Correct |
0 ms |
2256 KB |
Output is correct |
5 |
Correct |
0 ms |
2256 KB |
Output is correct |
6 |
Correct |
0 ms |
2256 KB |
Output is correct |
7 |
Correct |
0 ms |
2256 KB |
Output is correct |
8 |
Correct |
0 ms |
2256 KB |
Output is correct |
9 |
Correct |
0 ms |
2256 KB |
Output is correct |
10 |
Correct |
0 ms |
2256 KB |
Output is correct |
11 |
Correct |
0 ms |
2256 KB |
Output is correct |
12 |
Correct |
0 ms |
2256 KB |
Output is correct |
13 |
Correct |
0 ms |
2256 KB |
Output is correct |
14 |
Correct |
28 ms |
2256 KB |
Output is correct |
15 |
Correct |
35 ms |
2256 KB |
Output is correct |