# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422805 | 2021-06-10T12:40:53 Z | QCFium | Koala Game (APIO17_koala) | C++14 | 5 ms | 384 KB |
#include <bits/stdc++.h> #include "koala.h" int minValue(int n, int w) { int query[n]; for (int i = 0; i < n; i++) query[i] = !i; int response[n]; playRound(query, response); for (int i = 0; i < n; i++) if (response[i] <= query[i]) return i; assert(0); } int maxValue(int n, int w) { } int greaterValue(int n, int w) { } void allValues(int n, int w, int *p) { }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 280 KB | Output is correct |
2 | Correct | 5 ms | 328 KB | Output is correct |
3 | Correct | 5 ms | 200 KB | Output is correct |
4 | Correct | 5 ms | 200 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 384 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 328 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 200 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |