Submission #1105133

#TimeUsernameProblemLanguageResultExecution timeMemory
1105133jadai007Cave (IOI13_cave)C++17
0 / 100
11 ms504 KiB
#include "cave.h"
#include<bits/stdc++.h>

using namespace std;

void exploreCave(int N) {
    int state[N] = {0}, link[N] = {0};
    for(int i = 0; i < N; ++i){
        int ft = tryCombination(state);
        if(ft == -1) break;
        state[i] = 1;
        int nd = tryCombination(state);
        if(ft > nd){
            state[i] = 0;
            link[i] = ft;
        } 
        else if(ft < nd) link[i] = ft;
    }
    answer(state, link);
}
#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...