# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717293 | Juan | 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 "cave.h"
using namespace std;
void exploreCave(int N){
int S[N]={}, D[N]={};
vector<int> unprocessed;
for(int i = 0; i < N; i++) unprocessed.push_back(i);
for(int i = 0; i < N; i++){
for(int x : unprocessed) S[x] = 0;
if(tryCombination(vask)!=i){
for(int x : unprocessed) S[x] = 1;
}
int l = 0, r = unprocessed.size()-1;
while(l<=r){
int m = (l+r)>>1;
for(int j = 0; j <= m; j++) S[unprocessed[j]] ^= 1;
int ret = tryCombination(S);
if(ret==i) l = m+1;
else r = m-1;
for(int j = 0; j <= m; j++) S[unprocessed[j]] ^= 1;
}
int pos = unprocessed[l];
S[pos] ^= 1;
D[pos] = i;
unprocessed.erase(unprocessed.begin()+l);
}
answer(S, D);
}