# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
131935 | junodeveloper | 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 "cave.h"
#include <vector>
#include <algorithm>
using namespace std;
int S[5010], D[5010], rev[5010];
int Try() {
return tryCombination(S);
}
void exploreCave(int N) {
memset(D, -1, sizeof(D));
int s = 0, x, B, idx, tmp;
while(1) {
idx = Try();
if(idx != -1) x = idx - s + 1;
else x = N - s;
B = sqrt((N - s) / x);
vector<int> a;
for(int i=0; i<N; i++) {
if(D[i] == -1) {
a.push_back(i);
if(a.size() == B) {
for(auto& j : a) S[j] ^= 1;
tmp = Try();
if(idx != tmp) {
for(auto& j : a) S[j] ^= 1;
for(auto& j : a) {
S[j] ^= 1;
int t = Try();
if(t < idx || idx == -1) {
rev[t] = j;
D[j] = t;
} else if(idx < t) {
rev[idx] = j;
D[j] = idx;
}
}
for(auto& j : a) S[j] ^= 1;
}
for(auto& j : a) S[j] ^= 1;
a.clear();
}
}
}
}
answer(S, D);
}