Submission #68755

#TimeUsernameProblemLanguageResultExecution timeMemory
68755someone_aaCave (IOI13_cave)C++17
12 / 100
36 ms640 KiB
#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

void exploreCave(int N) {
    int open_comb[N];
    int sw[N];

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

    int curr[N];
    memset(curr,0,sizeof(curr));
    for(int i=0;i<N;i++) {
        int ans = tryCombination(curr);

        if(ans > i || ans == -1) open_comb[i] = 0;
        else if(ans == i) open_comb[i] = 1;
        curr[i] = open_comb[i];
    }
    answer(open_comb, sw);
}
#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...