Submission #647783

#TimeUsernameProblemLanguageResultExecution timeMemory
647783allin27xCave (IOI13_cave)C++14
13 / 100
15 ms392 KiB
#include <iostream>
#include <cave.h>
using namespace std;

int tryCombination(int S[]);
void answer(int S[], int D[]);

void exploreCave(int N){
    int ans[N] = {};
    int q[N] = {};

    q[0] = 1;
    ans[0] = tryCombination(q);

    for (int i=1; i<N; i++){
        q[i-1] = 0;
        q[i] = 1;
        ans[i] = tryCombination(q);
    }
    q[N-1] = 0;
    answer(q, ans);
}
#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...