# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
56104 |
2018-07-10T03:59:24 Z |
zetapi |
Friend (IOI14_friend) |
C++14 |
|
5 ms |
928 KB |
#include "friend.h"
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define itr ::iterator
const int MAX=1e5;
int findSample(int n,int confidence[],int host[],int protocol[])
{
int res=0;
for(int A=n-1;A>0;A--)
{
if(protocol[A]==0)
{
res+=confidence[A];
confidence[host[A]]-=confidence[A];
}
else if(protocol[A]==1)
confidence[host[A]]+=max(0,confidence[A]);
else
confidence[host[A]]=max(confidence[host[A]],confidence[A]);
}
return res+max(0,confidence[0]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
472 KB |
Output is correct |
4 |
Correct |
3 ms |
520 KB |
Output is correct |
5 |
Correct |
2 ms |
632 KB |
Output is correct |
6 |
Correct |
3 ms |
632 KB |
Output is correct |
7 |
Correct |
3 ms |
632 KB |
Output is correct |
8 |
Incorrect |
4 ms |
644 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
656 KB |
Output is correct |
2 |
Correct |
3 ms |
656 KB |
Output is correct |
3 |
Correct |
3 ms |
656 KB |
Output is correct |
4 |
Correct |
3 ms |
656 KB |
Output is correct |
5 |
Correct |
3 ms |
656 KB |
Output is correct |
6 |
Correct |
3 ms |
656 KB |
Output is correct |
7 |
Correct |
3 ms |
688 KB |
Output is correct |
8 |
Correct |
3 ms |
688 KB |
Output is correct |
9 |
Correct |
2 ms |
688 KB |
Output is correct |
10 |
Correct |
3 ms |
716 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
716 KB |
Output is correct |
2 |
Correct |
2 ms |
716 KB |
Output is correct |
3 |
Correct |
2 ms |
716 KB |
Output is correct |
4 |
Correct |
3 ms |
716 KB |
Output is correct |
5 |
Correct |
3 ms |
716 KB |
Output is correct |
6 |
Correct |
2 ms |
716 KB |
Output is correct |
7 |
Correct |
2 ms |
716 KB |
Output is correct |
8 |
Correct |
3 ms |
716 KB |
Output is correct |
9 |
Correct |
2 ms |
828 KB |
Output is correct |
10 |
Correct |
1 ms |
828 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
828 KB |
Output is correct |
2 |
Correct |
3 ms |
828 KB |
Output is correct |
3 |
Correct |
2 ms |
828 KB |
Output is correct |
4 |
Correct |
3 ms |
828 KB |
Output is correct |
5 |
Correct |
3 ms |
828 KB |
Output is correct |
6 |
Incorrect |
4 ms |
828 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
828 KB |
Output is correct |
2 |
Correct |
3 ms |
828 KB |
Output is correct |
3 |
Correct |
3 ms |
828 KB |
Output is correct |
4 |
Correct |
3 ms |
828 KB |
Output is correct |
5 |
Correct |
4 ms |
828 KB |
Output is correct |
6 |
Correct |
4 ms |
828 KB |
Output is correct |
7 |
Correct |
3 ms |
884 KB |
Output is correct |
8 |
Correct |
3 ms |
884 KB |
Output is correct |
9 |
Correct |
3 ms |
884 KB |
Output is correct |
10 |
Correct |
4 ms |
928 KB |
Output is correct |
11 |
Incorrect |
3 ms |
928 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
928 KB |
Output is correct |
2 |
Correct |
2 ms |
928 KB |
Output is correct |
3 |
Correct |
2 ms |
928 KB |
Output is correct |
4 |
Correct |
3 ms |
928 KB |
Output is correct |
5 |
Correct |
3 ms |
928 KB |
Output is correct |
6 |
Correct |
3 ms |
928 KB |
Output is correct |
7 |
Incorrect |
2 ms |
928 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |