Submission #235295

#TimeUsernameProblemLanguageResultExecution timeMemory
235295pere_gilCave (IOI13_cave)C++14
0 / 100
277 ms384 KiB
#include <iostream>
#include "cave.h"
using namespace std;

void exploreCave(int N)
{
    int D[N],S[N];
    for(int i=0;i<N;i++){ D[i]=i; S[i]=0; }
    int open=tryCombination(S);
    while(open<N){
        if(S[open]==0) S[open]=1;
        if(S[open]==1) S[open]=0;
        open=tryCombination(S);
    }
    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...