Submission #624799

#TimeUsernameProblemLanguageResultExecution timeMemory
624799Mr_Husanboy동굴 (IOI13_cave)C++14
13 / 100
11 ms468 KiB
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;


void exploreCave(int N) {
    vector<int> ans(N), ord;
    int n = N;
    for(int i = 0; i < n; i ++){
        ans[i] = 1;

        ord.push_back(tryCombination(ans.data()));

        ans[i] = 0;
    }
    answer(ans.data(), ord.data());
}
#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...