# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492905 | aris12345678 | Cave (IOI13_cave) | C++14 | 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 "graderlib.cpp"
#include "cave.h"
using namespace std;
const int mxN = 5005;
void exploreCave(int n) {
vector<int> doors(n, 0);
vector<int> pos(n);
iota(pos.begin(), pos.end(), 0);
while(true) {
int first = tryCombination(doors);
if(first == -1) break;
else
doors[first] = !doors[first];
}
answer(doors, pos);
}
// int main() {
// int N = init();
// exploreCave(N);
// return 0;
// }