Submission #1091016

#TimeUsernameProblemLanguageResultExecution timeMemory
1091016AndreasKCave (IOI13_cave)C++14
0 / 100
1 ms348 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

void exploreCave(int N) {
    int A[N] = {};
    int B[N];
    for (int c = 0; c < N; c++)
        B[c] = c + 1;
    int x = tryCombination(A);
    while (x != -1) {
        A[x - 1] = 1;
        x = tryCombination(A);
    }
    answer(A, B);
}
#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...