Submission #521043

#TimeUsernameProblemLanguageResultExecution timeMemory
521043lordlorinc동굴 (IOI13_cave)C++17
12 / 100
16 ms364 KiB
#include "cave.h"

#include<bits/stdc++.h>
using namespace std;

void exploreCave(int N) {
    int n = N;
    int mo[n] = {};
    for (int i = 0; i < n; i++){
        mo[i] = 0;
        if (tryCombination(mo) == i) mo[i] = 1;
    }
    int mo2[n];
    for (int i = 0; i < n; i++) mo2[i] = i;
    answer(mo, mo2);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...