| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 49248 |
2018-05-24T13:19:35 Z |
Diuven |
Friend (IOI14_friend) |
C++11 |
|
63 ms |
5400 KB |
#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
const int MX=100010;
int findSample(int n, int A[], int F[], int Prot[]){
int X[MX], Y[MX]; // picked / not-picked
for(int i=0; i<n; i++) X[i]=A[i], Y[i]=0;
for(int i=n-1; i>0; i--){
if(Prot[i]==0){
X[F[i]]=X[F[i]]+Y[i];
Y[F[i]]=max(Y[F[i]]+X[i], Y[F[i]]+Y[i]);
}
else if(Prot[i]==1){
X[F[i]]=max({X[F[i]]+Y[i], X[F[i]]+X[i], Y[F[i]]+X[i]});
Y[F[i]]=Y[F[i]]+Y[i];
}
else{
X[F[i]]=max(X[F[i]]+Y[i], Y[F[i]]+X[i]);
Y[F[i]]=Y[F[i]]+Y[i];
}
}
return max(X[0],Y[0]);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
252 KB |
Output is correct |
| 2 |
Correct |
3 ms |
356 KB |
Output is correct |
| 3 |
Correct |
2 ms |
432 KB |
Output is correct |
| 4 |
Correct |
2 ms |
436 KB |
Output is correct |
| 5 |
Correct |
2 ms |
448 KB |
Output is correct |
| 6 |
Correct |
2 ms |
484 KB |
Output is correct |
| 7 |
Correct |
2 ms |
484 KB |
Output is correct |
| 8 |
Correct |
2 ms |
484 KB |
Output is correct |
| 9 |
Correct |
2 ms |
532 KB |
Output is correct |
| 10 |
Correct |
2 ms |
540 KB |
Output is correct |
| 11 |
Correct |
2 ms |
672 KB |
Output is correct |
| 12 |
Correct |
2 ms |
672 KB |
Output is correct |
| 13 |
Correct |
2 ms |
672 KB |
Output is correct |
| 14 |
Correct |
2 ms |
672 KB |
Output is correct |
| 15 |
Correct |
2 ms |
672 KB |
Output is correct |
| 16 |
Correct |
2 ms |
672 KB |
Output is correct |
| 17 |
Correct |
2 ms |
672 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
672 KB |
Output is correct |
| 2 |
Correct |
2 ms |
672 KB |
Output is correct |
| 3 |
Correct |
2 ms |
672 KB |
Output is correct |
| 4 |
Correct |
2 ms |
672 KB |
Output is correct |
| 5 |
Correct |
2 ms |
672 KB |
Output is correct |
| 6 |
Correct |
3 ms |
672 KB |
Output is correct |
| 7 |
Correct |
2 ms |
672 KB |
Output is correct |
| 8 |
Correct |
3 ms |
672 KB |
Output is correct |
| 9 |
Correct |
3 ms |
672 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 |
3 ms |
716 KB |
Output is correct |
| 3 |
Correct |
3 ms |
716 KB |
Output is correct |
| 4 |
Correct |
2 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 |
716 KB |
Output is correct |
| 10 |
Correct |
3 ms |
716 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
716 KB |
Output is correct |
| 2 |
Correct |
2 ms |
716 KB |
Output is correct |
| 3 |
Correct |
3 ms |
716 KB |
Output is correct |
| 4 |
Correct |
3 ms |
716 KB |
Output is correct |
| 5 |
Correct |
2 ms |
716 KB |
Output is correct |
| 6 |
Correct |
3 ms |
716 KB |
Output is correct |
| 7 |
Correct |
3 ms |
716 KB |
Output is correct |
| 8 |
Correct |
3 ms |
716 KB |
Output is correct |
| 9 |
Correct |
3 ms |
716 KB |
Output is correct |
| 10 |
Correct |
3 ms |
720 KB |
Output is correct |
| 11 |
Correct |
4 ms |
724 KB |
Output is correct |
| 12 |
Correct |
3 ms |
748 KB |
Output is correct |
| 13 |
Correct |
3 ms |
760 KB |
Output is correct |
| 14 |
Correct |
3 ms |
792 KB |
Output is correct |
| 15 |
Correct |
3 ms |
792 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
804 KB |
Output is correct |
| 2 |
Correct |
2 ms |
804 KB |
Output is correct |
| 3 |
Correct |
3 ms |
804 KB |
Output is correct |
| 4 |
Correct |
2 ms |
804 KB |
Output is correct |
| 5 |
Correct |
2 ms |
804 KB |
Output is correct |
| 6 |
Correct |
2 ms |
804 KB |
Output is correct |
| 7 |
Correct |
2 ms |
804 KB |
Output is correct |
| 8 |
Correct |
2 ms |
804 KB |
Output is correct |
| 9 |
Correct |
2 ms |
804 KB |
Output is correct |
| 10 |
Correct |
2 ms |
804 KB |
Output is correct |
| 11 |
Correct |
2 ms |
804 KB |
Output is correct |
| 12 |
Correct |
3 ms |
804 KB |
Output is correct |
| 13 |
Correct |
3 ms |
808 KB |
Output is correct |
| 14 |
Correct |
3 ms |
812 KB |
Output is correct |
| 15 |
Correct |
2 ms |
836 KB |
Output is correct |
| 16 |
Correct |
2 ms |
840 KB |
Output is correct |
| 17 |
Correct |
0 ms |
844 KB |
Output is correct |
| 18 |
Correct |
3 ms |
848 KB |
Output is correct |
| 19 |
Correct |
2 ms |
852 KB |
Output is correct |
| 20 |
Correct |
2 ms |
856 KB |
Output is correct |
| 21 |
Correct |
3 ms |
864 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
888 KB |
Output is correct |
| 2 |
Correct |
2 ms |
892 KB |
Output is correct |
| 3 |
Correct |
2 ms |
892 KB |
Output is correct |
| 4 |
Correct |
3 ms |
892 KB |
Output is correct |
| 5 |
Correct |
2 ms |
892 KB |
Output is correct |
| 6 |
Correct |
2 ms |
892 KB |
Output is correct |
| 7 |
Correct |
2 ms |
892 KB |
Output is correct |
| 8 |
Correct |
2 ms |
892 KB |
Output is correct |
| 9 |
Correct |
2 ms |
892 KB |
Output is correct |
| 10 |
Correct |
2 ms |
900 KB |
Output is correct |
| 11 |
Correct |
2 ms |
900 KB |
Output is correct |
| 12 |
Correct |
42 ms |
2812 KB |
Output is correct |
| 13 |
Correct |
24 ms |
2812 KB |
Output is correct |
| 14 |
Correct |
39 ms |
4248 KB |
Output is correct |
| 15 |
Correct |
63 ms |
5400 KB |
Output is correct |
