# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
15691 |
2015-07-15T11:28:32 Z |
ainta |
Friend (IOI14_friend) |
C++ |
|
40 ms |
3044 KB |
#include "friend.h"
#include<algorithm>
using namespace std;
// Find out best sample
int Gap[101000][2];
int findSample(int n,int confidence[],int host[],int protocol[]){
int i;
for(i=0;i<n;i++)Gap[i][0]=confidence[i];
for(i=n-1;i>0;i--){
if(protocol[i] == 1){
Gap[host[i]][0] += Gap[i][0];
Gap[host[i]][1] += Gap[i][1];
}
if(protocol[i] == 2){
Gap[host[i]][0] = max(Gap[i][0] + Gap[host[i]][1], Gap[host[i]][0] + Gap[i][1]);
Gap[host[i]][1] += Gap[i][1];
}
if(protocol[i] == 0){
Gap[host[i]][0] += Gap[i][1];
Gap[host[i]][1] += Gap[i][0];
}
Gap[host[i]][0]=max(Gap[host[i]][0], Gap[host[i]][1]);
}
return max(Gap[0][0],Gap[0][1]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3044 KB |
Output is correct |
2 |
Correct |
0 ms |
3044 KB |
Output is correct |
3 |
Correct |
0 ms |
3044 KB |
Output is correct |
4 |
Correct |
0 ms |
3044 KB |
Output is correct |
5 |
Correct |
0 ms |
3044 KB |
Output is correct |
6 |
Correct |
0 ms |
3044 KB |
Output is correct |
7 |
Correct |
0 ms |
3044 KB |
Output is correct |
8 |
Correct |
0 ms |
3044 KB |
Output is correct |
9 |
Correct |
0 ms |
3044 KB |
Output is correct |
10 |
Correct |
0 ms |
3044 KB |
Output is correct |
11 |
Correct |
0 ms |
3044 KB |
Output is correct |
12 |
Correct |
0 ms |
3044 KB |
Output is correct |
13 |
Correct |
0 ms |
3044 KB |
Output is correct |
14 |
Correct |
0 ms |
3044 KB |
Output is correct |
15 |
Correct |
0 ms |
3044 KB |
Output is correct |
16 |
Correct |
0 ms |
3044 KB |
Output is correct |
17 |
Correct |
0 ms |
3044 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3044 KB |
Output is correct |
2 |
Correct |
0 ms |
3044 KB |
Output is correct |
3 |
Correct |
0 ms |
3044 KB |
Output is correct |
4 |
Correct |
0 ms |
3044 KB |
Output is correct |
5 |
Correct |
0 ms |
3044 KB |
Output is correct |
6 |
Correct |
0 ms |
3044 KB |
Output is correct |
7 |
Correct |
0 ms |
3044 KB |
Output is correct |
8 |
Correct |
0 ms |
3044 KB |
Output is correct |
9 |
Correct |
0 ms |
3044 KB |
Output is correct |
10 |
Correct |
0 ms |
3044 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3044 KB |
Output is correct |
2 |
Correct |
0 ms |
3044 KB |
Output is correct |
3 |
Correct |
0 ms |
3044 KB |
Output is correct |
4 |
Correct |
0 ms |
3044 KB |
Output is correct |
5 |
Correct |
0 ms |
3044 KB |
Output is correct |
6 |
Correct |
0 ms |
3044 KB |
Output is correct |
7 |
Correct |
0 ms |
3044 KB |
Output is correct |
8 |
Correct |
0 ms |
3044 KB |
Output is correct |
9 |
Correct |
0 ms |
3044 KB |
Output is correct |
10 |
Correct |
0 ms |
3044 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3044 KB |
Output is correct |
2 |
Correct |
0 ms |
3044 KB |
Output is correct |
3 |
Correct |
0 ms |
3044 KB |
Output is correct |
4 |
Correct |
0 ms |
3044 KB |
Output is correct |
5 |
Correct |
0 ms |
3044 KB |
Output is correct |
6 |
Correct |
0 ms |
3044 KB |
Output is correct |
7 |
Correct |
0 ms |
3044 KB |
Output is correct |
8 |
Correct |
0 ms |
3044 KB |
Output is correct |
9 |
Correct |
0 ms |
3044 KB |
Output is correct |
10 |
Correct |
0 ms |
3044 KB |
Output is correct |
11 |
Correct |
0 ms |
3044 KB |
Output is correct |
12 |
Correct |
0 ms |
3044 KB |
Output is correct |
13 |
Correct |
0 ms |
3044 KB |
Output is correct |
14 |
Correct |
0 ms |
3044 KB |
Output is correct |
15 |
Correct |
0 ms |
3044 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3044 KB |
Output is correct |
2 |
Correct |
0 ms |
3044 KB |
Output is correct |
3 |
Correct |
0 ms |
3044 KB |
Output is correct |
4 |
Correct |
0 ms |
3044 KB |
Output is correct |
5 |
Correct |
0 ms |
3044 KB |
Output is correct |
6 |
Correct |
0 ms |
3044 KB |
Output is correct |
7 |
Correct |
0 ms |
3044 KB |
Output is correct |
8 |
Correct |
0 ms |
3044 KB |
Output is correct |
9 |
Correct |
0 ms |
3044 KB |
Output is correct |
10 |
Correct |
0 ms |
3044 KB |
Output is correct |
11 |
Correct |
0 ms |
3044 KB |
Output is correct |
12 |
Correct |
0 ms |
3044 KB |
Output is correct |
13 |
Correct |
0 ms |
3044 KB |
Output is correct |
14 |
Correct |
0 ms |
3044 KB |
Output is correct |
15 |
Correct |
0 ms |
3044 KB |
Output is correct |
16 |
Correct |
0 ms |
3044 KB |
Output is correct |
17 |
Correct |
0 ms |
3044 KB |
Output is correct |
18 |
Correct |
0 ms |
3044 KB |
Output is correct |
19 |
Correct |
0 ms |
3044 KB |
Output is correct |
20 |
Correct |
0 ms |
3044 KB |
Output is correct |
21 |
Correct |
0 ms |
3044 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
3044 KB |
Output is correct |
2 |
Correct |
0 ms |
3044 KB |
Output is correct |
3 |
Correct |
0 ms |
3044 KB |
Output is correct |
4 |
Correct |
0 ms |
3044 KB |
Output is correct |
5 |
Correct |
0 ms |
3044 KB |
Output is correct |
6 |
Correct |
0 ms |
3044 KB |
Output is correct |
7 |
Correct |
0 ms |
3044 KB |
Output is correct |
8 |
Correct |
0 ms |
3044 KB |
Output is correct |
9 |
Correct |
0 ms |
3044 KB |
Output is correct |
10 |
Correct |
0 ms |
3044 KB |
Output is correct |
11 |
Correct |
0 ms |
3044 KB |
Output is correct |
12 |
Correct |
37 ms |
3044 KB |
Output is correct |
13 |
Correct |
15 ms |
3044 KB |
Output is correct |
14 |
Correct |
34 ms |
3044 KB |
Output is correct |
15 |
Correct |
40 ms |
3044 KB |
Output is correct |