# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954446 | 2024-03-27T23:57:44 Z | __Davit__ | Cave (IOI13_cave) | C++17 | 2 ms | 460 KB |
#include "cave.h" #include <bits/stdc++.h> using namespace std; namespace { int *subtask2(int a[]) { return 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; int *b = subtask2(a); // for (int i = 0; i < N; i++)b[i] = i; // int x = tryCombination(a); answer(a, b); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 460 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Answer is wrong |
2 | Halted | 0 ms | 0 KB | - |