Submission #1083073

#TimeUsernameProblemLanguageResultExecution timeMemory
1083073erdemfurkanCave (IOI13_cave)C++14
0 / 100
1 ms348 KiB
#include "cave.h"

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