# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
68623 |
2018-08-17T15:35:34 Z |
KLPP |
Koala Game (APIO17_koala) |
C++14 |
|
9 ms |
804 KB |
#include "koala.h"
int minValue(int N, int W) {
int arr[N];
for(int i=0;i<N;i++)arr[i]=0;
arr[0]=1;
int R[N];
playRound(arr,R);
if(R[0]<2){
return 0;
}else{
for(int i=0;i<N;i++){
if(R[i]==0)return i;
}
}
return 0;
}
int maxValue(int N, int W) {
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
int greaterValue(int N, int W) {
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
// TODO: Implement Subtask 4 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
376 KB |
Output is correct |
2 |
Correct |
7 ms |
416 KB |
Output is correct |
3 |
Correct |
8 ms |
508 KB |
Output is correct |
4 |
Correct |
8 ms |
604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
712 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
712 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
804 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |