제출 #992839

#제출 시각아이디문제언어결과실행 시간메모리
992839mohammedMonemCave (IOI13_cave)C++14
0 / 100
1 ms348 KiB
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

void exploreCave(int N) {
    int comp[N];
    memset(comp, 0, N);
    int try1 = tryCombination(comp);
    if (try1 > 0) {
        memset(comp, 1, N);
        try1 = tryCombination(comp);
    }
    int v[N];
    for (int i = 0; i < N; ++i) {
        comp[i] = !comp[i];
        int try2 = tryCombination(comp);
        v[i] = try2;
        comp[i] = !comp[i];
    }
    answer(v, comp);
}
#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...