# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61343 | 2018-07-25T16:04:46 Z | the_art_of_war | Xylophone (JOI18_xylophone) | C++14 | 3 ms | 436 KB |
#include "xylophone.h" static int A[5000]; void solve(int N) { int value = query(1, N); for(int i = 1; i <= N; i++) { answer(i, i); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Incorrect | 3 ms | 436 KB | Wrong Answer [7] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Incorrect | 3 ms | 436 KB | Wrong Answer [7] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Incorrect | 3 ms | 436 KB | Wrong Answer [7] |
3 | Halted | 0 ms | 0 KB | - |