Submission #630594

#TimeUsernameProblemLanguageResultExecution timeMemory
630594ttamxCave (IOI13_cave)C++14
0 / 100
482 ms432 KiB
#include "cave.h"
#include<bits/stdc++.h>

using namespace std;

void exploreCave(int n) {
    int s[n]={};
    int d[n]={};
    bool vis[n]={};
    for(int i=0;i<n;++i){
        int st;
        if(tryCombination(s)==i)st=0;
        else st=1;
        int l=0,r=n;
        while(l+1<r){
            int m=(l+r)/2;
            int tmp[n];
            for(int i=0;i<n;++i)if(!vis[i])tmp[i]=1-st;
            for(int i=l;i<=m;++i)if(!vis[n])tmp[i]=st;
            if(tryCombination(tmp)==i)r=m;
            else l=m;
        }
        s[l]=st;
        vis[l]=1;
        d[l]=i;
    }
    answer(s,d);
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...