# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239112 | 2020-06-14T12:36:01 Z | urd05 | Koala Game (APIO17_koala) | C++14 | 10 ms | 384 KB |
#include <bits/stdc++.h> #include "koala.h" using namespace std; int minValue(int N, int W) { int b[100]; b[0]=1; int r[100]; playRound(b,r); int ret; if (r[0]==2) { for(int i=1;i<N;i++) { if (r[i]==0) { return i; } } } else { return 0; } return 0; } int maxValue(int N, int W) { bool alive[100]; int b[100]; for(int i=0;i<N;i++) { alive[i]=true; } while (1) { memset(b,0,sizeof(b)); for(int i=0;i<N;i++) { if (alive[i]) { b[i]=1; } } int r[100]; playRound(b,r); for(int i=0;i<N;i++) { if (r[i]<=b[i]) { alive[i]=false; } } int cnt=0; for(int i=0;i<N;i++) { if (alive[i]) { cnt++; } } if (cnt==1) { break; } } for(int i=0;i<N;i++) { if (alive[i]) { return i; } } } 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. } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 384 KB | Output is correct |
2 | Correct | 10 ms | 384 KB | Output is correct |
3 | Correct | 10 ms | 384 KB | Output is correct |
4 | Correct | 9 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |