Submission #235296

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