# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954449 | 2024-03-28T00:08:59 Z | __Davit__ | Cave (IOI13_cave) | C++17 | 9 ms | 568 KB |
#include "cave.h" #include <bits/stdc++.h> using namespace std; namespace { int *subtask2(int a[]) { int n = sizeof(a) / sizeof(int); int res[n]; for (int i = 0; i < n; i++) { a[i] ^= 1; int x = tryCombination(a); a[i] ^= 1; res[i] = x; } return res; } } void exploreCave(int N) { int a[N]; for (int i = 0; i < N; i++)a[i] = 0; // for (int i = 0; i < N; i++)b[i] = i; // int x = tryCombination(a); // N = sizeof(a) / sizeof(int); int b[N]; for (int i = 0; i < N; i++) { a[i] ^= 1; int x = tryCombination(a); a[i] ^= 1; b[i] = x; } answer(a, b); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 8 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 9 ms | 568 KB | Output is correct |
7 | Correct | 8 ms | 348 KB | Output is correct |
8 | Correct | 9 ms | 348 KB | Output is correct |
9 | Correct | 8 ms | 344 KB | Output is correct |
10 | Correct | 9 ms | 348 KB | Output is correct |
11 | Correct | 8 ms | 448 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 1 ms | 344 KB | Answer is wrong |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 1 ms | 344 KB | Answer is wrong |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |