제출 #520712

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

int par[5000], s[5000];
// par-mihez tartozik, 0-down, 1-up

void exploreCave(int n) {
    // 1
    for (int i=0; i<n; i++) {
        par[i]=i;
    }
    while (true) {
        int x=tryCombination(s);
        if (x==-1) {
            break;
        }
        s[x]=1;
    }
    answer(s, par);
}
#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...