Submission #1314552

#	Time	Username	Problem	Language	Result	Execution time	Memory
1314552		Agageldi	Cave (IOI13_cave)	C++20	12 / 100	8 ms	504 KiB

cave

#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;
    }
    while(1) {
        int tr = tryCombination(a);
        if(tr == -1) break;
        a[tr] = 1 - a[tr];
    }
    answer(a,b);
}

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