Submission #953472

#TimeUsernameProblemLanguageResultExecution timeMemory
953472__Davit__Cave (IOI13_cave)C++17
12 / 100
8 ms604 KiB
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

void exploreCave(int N) {
    int a[N];
    int b[N];
    for (int i = 0; i < N; i++)a[i] = 0;
    for (int i = 0; i < N; i++)b[i] = i;
    int x = tryCombination(a);
    while (x != -1) {
        a[x] ^= 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...