Submission #1216805

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216805		takoshanava	Cave (IOI13_cave)	C++20	100 / 100	286 ms	516 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int N) {
    int s[N], d[N];
    bool f[N];
    for (int i = 0; i < N; i++) {
        s[i] = 0;
        d[i] = 0;
        f[i] = false;
    }

    for (int j = 0; j < N; j++) {
        for (int i = 0; i < N; i++) {
            if (!f[i]) s[i] = 0;
        }

        int x = tryCombination(s);
        int k = (x != j ? 0 : 1);

        for (int i = 0; i < N; i++) {
            if (!f[i]) s[i] = 1 - k;
        }

        int l = 0, r = N - 1, idx = 0;
        while (l < r) {
            int mid = (l + r) / 2;
            for (int i = l; i <= mid; i++) {
                if (!f[i]) s[i] = k;
            }

            x = tryCombination(s);

            if (x != j) {
                idx = mid;
                r = mid;
            } else {
                idx = mid + 1;
                l = mid + 1;
            }

            for (int i = l; i <= mid; i++) {
                if (!f[i]) s[i] = 1 - k;
            }
        }

        d[idx] = j;
        f[idx] = true;
        s[idx] = k;
    }

    answer(s, d);
}

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