# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382322 | 2021-03-27T05:41:42 Z | Andyvanh1 | Cave (IOI13_cave) | C++14 | 18 ms | 492 KB |
#include <iostream> #include <vector> #include "cave.h" using namespace std; void exploreCave(int n){ int S[n]; int D[n]; for(int i = 0; i < n; i++){ S[i] = 0; D[i] = i; } int k = 0; for(int i = 0; i < n; i++){ S[i] = 1; D[i] = tryCombination(S); S[i] = 0; } answer(S,D); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 364 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 15 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
6 | Correct | 14 ms | 492 KB | Output is correct |
7 | Correct | 14 ms | 492 KB | Output is correct |
8 | Correct | 18 ms | 492 KB | Output is correct |
9 | Correct | 18 ms | 492 KB | Output is correct |
10 | Correct | 17 ms | 492 KB | Output is correct |
11 | Correct | 14 ms | 492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 1 ms | 364 KB | Answer is wrong |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 1 ms | 364 KB | Answer is wrong |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 364 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |