Submission #166692

#TimeUsernameProblemLanguageResultExecution timeMemory
166692samsCave (IOI13_cave)C++14
13 / 100
27 ms512 KiB
#include "cave.h"

void exploreCave(int N) {
    int S[N+1];
    int D[N+1];

    for(int i = 0 ; i < N ; ++i) S[i] = D[i] = 0;

    for(int i = 0 ; i < N ; ++i)
    {
        S[i] = 1;

        int s = tryCombination(S);
        
        //printf("%d\n", s);
        D[i] = 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...