Submission #759689

#TimeUsernameProblemLanguageResultExecution timeMemory
759689Andrey동굴 (IOI13_cave)C++14
12 / 100
15 ms428 KiB
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;

void exploreCave(int n) {
    int ans[n];
    int sw[n];
    for(int i = 0; i < n; i++) {
        sw[i] = 0;
        ans[i] = i;
    }
    for(int i = 0; i < n; i++) {
        if(tryCombination(sw) == i) {
            sw[i] = 1;
        }
    }
    answer(sw,ans);
}
#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...