Submission #235096

#TimeUsernameProblemLanguageResultExecution timeMemory
235096jam_xd_Cave (IOI13_cave)C++17
12 / 100
25 ms640 KiB
#include "cave.h"
#include "bits/stdc++.h"

using namespace std;
 
void exploreCave(int N) {
    int S[N];
    int D[N];

    for(int i=0;i<N;i++){
        S[i] = 0;
        D[i] = i;
    }

    for(int i=0;i<N;i++){

        if(tryCombination(S) == -1)break;
        S[tryCombination(S)] = 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...