Submission #1042029

#TimeUsernameProblemLanguageResultExecution timeMemory
1042029blackslexCave (IOI13_cave)C++17
0 / 100
1 ms348 KiB
#include "cave.h"
#include<bits/stdc++.h>

using namespace std;

void exploreCave(int N) {
    int D[N] = {}, pos[N] = {};
    for (int i = 0; i < N; i++) D[i] = 0, pos[i] = i;
    int cmx = tryCombination(D);
    if (!(~cmx)) return void(answer(D, pos));
    for (int i = cmx + 1; i < N; i++) {
        int z0 = tryCombination(D);
        if (!(~cmx)) return void(answer(D, pos));
        if (z0 >= i) continue;
        D[i] = 1;
    }
    answer(D, pos);
}
#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...