제출 #1314554

#제출 시각아이디문제언어결과실행 시간메모리
1314554Agageldi동굴 (IOI13_cave)C++20
13 / 100
7 ms332 KiB
#include "bits/stdc++.h"
// #include "grader.c"
#include "cave.h"

#define MAXN 500005

int a[MAXN], n, b[MAXN];

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