Submission #228743

#TimeUsernameProblemLanguageResultExecution timeMemory
228743jhtanCave (IOI13_cave)C++14
0 / 100
12 ms512 KiB
#include "cave.h"

using namespace std;

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

    //memset(S, 0, sizeof(S));
    for(int i=0; i<N; i++) {
        S[i] = 0;
        D[i] = i + 1;
    } 

    for(int i=0; i<N; i++) {
        int x = tryCombination(S);
        if(x == -1) break;
        if(x == 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...