# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1263247 | blueviolet | Cave (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
int s[5009], d[5009];
set<int> st;
void exploreCave(int N) {
st.clear();
for (int i = 0; i < N; i++) {
s[i] = 0;
d[i] = 0;
}
while (true) {
int firstClosed = tryCombination(s);
if (firstClosed == -1) break;
for (int i=0; i<n; i++) {
s[i] ^= 1;
int pp = tryCombination(s);
if (pp == -1) pp = Inf;
if (pp > firstClosed) {
d[i] = firstClosed;
break;
} else
s[i] ^= 1;
}
}
answer(s, d);
}