제출 #992864

#제출 시각아이디문제언어결과실행 시간메모리
992864vjudge1동굴 (IOI13_cave)C++17
0 / 100
2 ms348 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

// int tryCombination(int S[]);
// void answer(int S[], int D[]);

#define ask(x) tryCombination(x)

void exploreCave(int n) {
    int lvr[n] = {}, pos[n];
    iota(pos, pos + n, 0);
    for(int i = 0; i < n; i++){
        lvr[i] = ask(lvr) != i;
    }
    answer(lvr, pos);
}
#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...