Submission #456245

#TimeUsernameProblemLanguageResultExecution timeMemory
456245osmanallazovCave (IOI13_cave)C++14
12 / 100
10 ms436 KiB
#include "cave.h"
#include <bits/stdc++.h>
#define forr(i,A,B) for(int i=A;i<B;++i)
using namespace std;
void exploreCave(int N) {
    int a[N]={0},ans[N],done[N];
    memset(ans,-1,sizeof ans);
    memset(done,-1,sizeof done);
    forr(i,0,N) ans[i]=i;
    int lo=tryCombination(a);
    forr(i,0,N){
    	lo=tryCombination(a);
    	if(lo==-1) break;
    	a[lo]=!a[lo];
    }  	
    answer(a,ans); 
}
#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...