Submission #1314528

#	Time	Username	Problem	Language	Result	Execution time	Memory
1314528		Agageldi	Cave (IOI13_cave)	C++20	0 / 100	1 ms	568 KiB

cave

#include "bits/stdc++.h"
// #include "grader.c"
#include "cave.h"

#define MAXN 500005

int a[MAXN], n, b[MAXN];
void solve(int x) {
    if(x == n) {
        int p = tryCombination(a);
        if(p == -1) {
            answer(a, b);
        }
        return;
    }
    a[x] = 0;
    solve(x + 1);
    a[x] = 1;
    solve(x + 1);
}

void exploreCave(int N) {
    n = N;
    for(int i = 0; i < n; i++) {
        b[i] = i;
    }
    solve(0);
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24