# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
857490 | chilinhxyzabc | 동굴 (IOI13_cave) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
int Try(int id, int s[]) {
s[id] = 1 - s[id];
int door = tryCombination(s);
s[id] = 1 - s[id];
return door;
}
void exploreCave(int n) {
int s[n], d[n];
for(int i = 0; i < n; i++) {
d[i] = -1;
}
int curDoor = tryCombination(s);
int curId = 0;
while(curDoor != -1) {
while(curId < n && Try(curId) != curDoor) {
curId++;
}
d[curId - 1] = curDoor;
s[curId - 1] = 1 - s[curId - 1];
curDoor = tryCombination(s);
}
for(int i = 0; i < n; i++) {
if(d[i] == -1) {
s[i] = 1 - s[i];
d[i] = tryCombination(s);
s[i] = 1 - s[i];
}
}
answer(s, d);
}