Submission #432077

#TimeUsernameProblemLanguageResultExecution timeMemory
432077MilosMilutinovic동굴 (IOI13_cave)C++14
13 / 100
18 ms420 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

int tryCombination(int S[]);

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

void exploreCave(int N) {
    int combination[N];
    for (int i = 0; i < N; i++)
        combination[i] = 0;

    if (tryCombination(combination) == -1) {
        int position[N];
        for (int i = 0; i < N; i++) {
            combination[i] = 1;
            position[i] = tryCombination(combination);
            combination[i] = 0;
        }

        answer(combination, position);
    }
}
#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...