# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1263238 | blueviolet | Cave (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
vector<int> s(N, 0), d(N, 0);
set<int> st;
for (int i = 0; i < N; i++) st.insert(i);
while (true) {
int firstClosed = tryCombination(s);
if (firstClosed == -1) break;
for (auto it = st.begin(); it != st.end();) {
int pos = *it;
s[pos] ^= 1;
int pp = tryCombination(s);
if (pp == -1) break;
if (pp < firstClosed) {
s[pos] ^= 1;
d[pos] = pp;
it = st.erase(it);
} else if (pp > firstClosed) {
d[pos] = firstClosed;
it = st.erase(it);
break;
} else {
s[pos] ^= 1;
++it;
}
}
}
answer(s, d);
}