# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226106 | 2020-04-22T14:29:14 Z | theStaticMind | Koala Game (APIO17_koala) | C++14 | 23 ms | 384 KB |
#include "koala.h" #include <bits/stdc++.h> using namespace std; int B[105], R[105]; int minValue(int N, int W) { } int maxValue(int N, int W) { bool rem[105]; for(int i = 0; i < N; i++) rem[i] = true; auto recalc = [&](){ int sum = 0; for(int i = 0; i < N; i++) if(rem[i]) sum++; for(int i = 0; i < N; i++){ if(rem[i]) B[i] = W / sum; else B[i] = 0; } }; for(int t = 0; t < 4; t++){ recalc(); playRound(B, R); for(int i = 0; i < N; i++){ if(R[i] <= B[i]) rem[i] = false; } } for(int i = 0; i < N; i++){ if(rem[i]) return i; } assert(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. } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 384 KB | Output is correct |
2 | Correct | 21 ms | 384 KB | Output is correct |
3 | Correct | 21 ms | 384 KB | Output is correct |
4 | Correct | 21 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 256 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 | 4 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |