# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1091556 |
2024-09-21T08:40:55 Z |
AndreasK |
Cave (IOI13_cave) |
C++14 |
|
1 ms |
348 KB |
#include <bits/stdc++.h>
#include <cave.h>
using namespace std;
#define designed ios_base::sync_with_stdio(0);
#define by cin.tie(0);
#define AndreasK cout.tie(0);
//#define int long long
#define ii pair <int, int>
#define vi vector <int>
#define iii pair <int, ii>
#define vii vector <ii>
#define vc vector <char>
#define vb vector <bool>
void exploreCave(int n) {
int a[n] = {}, b[n];
stack <int> s;
int x = tryCombination(a);
if (x == -1)
x = n;
for (int c = 0; c < n; c++) {
int prevx = x;
a[c] ^= 1;
x = tryCombination(a);
if (x == -1)
x = n;
if (x > prevx) {
while (!s.empty()) {
a[s.top()] ^= 1;
prevx = x;
x = tryCombination(a);
if (x == -1)
x = n;
if (x <= prevx) {
a[s.top()] ^= 1;
}
else {
s.pop();
}
}
}
else if (x == prevx)
s.push(c);
else {
a[c] ^= 1;
}
}
for (int c = 0; c < n; c++) {
a[c] ^= 1;
x = tryCombination(a);
a[c] ^= 1;
b[c] = x;
}
answer(a, b);
}
# |
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 |
1 ms |
348 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 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 |
- |