Submission #1231985

#TimeUsernameProblemLanguageResultExecution timeMemory
1231985clemmy14Cave (IOI13_cave)C++20
0 / 100
5 ms328 KiB
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;

void exploreCave(int N) {
    int comb[N], con[N];
    for(int i=0; i<N; i++) {
        con[i]=i; comb[i]=0;
    }

    for(int i=0; i<N; i++) {
        //cout << tryCombination(comb) << ' ' << i+1 << endl;
        int firstC=tryCombination(comb);
        if(i == N-1 && firstC == -1) continue;
        if(firstC <= i) comb[i]=1;
    }
    answer(comb, con);
}
#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...