Submission #235299

#TimeUsernameProblemLanguageResultExecution timeMemory
235299pere_gilCave (IOI13_cave)C++14
0 / 100
27 ms512 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++){ S[i]=0; }
    if(tryCombination(S)!=N-1){
        for(int i=0;i<N;i++){ D[i]=i; }
        for(int i=0;i<N;i++){
            if(tryCombination(S)==i) S[i]=1;
        }
    }
    else{
        for(int i=0;i<N;i++){
            S[i]=1;
            D[i]=tryCombination(S);
            S[i]=0;
        }
    }
    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...