# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919015 | Gwynbleidd_ | 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 <bits/stdc++.h>
using namespace std;
int n;
vector<int> flip, pos;
int comb(vector<int>& a){
int q[n];
for(int i=0;i<n;i++) q[i]=a[i];
return tryCombination(q);
}
void answer(){
int flip[n], pos[n];
for(int i=0;i<n;i++) flip[i]=f[i], pos[i]=p[i];
answer(flip,pos);
}
void dac(vector<int>& a, vector<int>& ind, int last){
if(ind.size()==1){
if(last==-1){
flip[ind[0]]=a[ind[0]];
a[ind[0]]=1-a[ind[0]];
p[ind[0]]=comb(a);
}
else{
p[ind[0]]=last;
flip[ind[0]]=1-a[ind[0]];
}
}
else{
vector<int> l,r;
for(int i=0;i<ind.size();i++){
if(i<ind.size()/2){
a[i]=1-a[i];
l.push_back(i);
}
else{
r.push_back(i);
}
}
int x=comb(a);
if(x==last){
for(int i=0;i<l.size();i++){
a[i]=1-a[i];
}
dac(a,r,last);
}
else{
dac(a,l,last);
}
}
}
void exploreCave(int N) {
n=N;
flip.assign(n,-1);
pos.assign(n,-1);
vector<int> a(n);
for(int t=0;t<n;t++){
for(int i=0;i<n;i++){
vector<int> ind;
if(flip[i]!=-1){
a[i]=flip[i];
}
else{
ind.push_back(i);
a[i]=0;
}
}
if(!ind.size()){
break;
}
dac(a,comb(a))
}
answer();
}