Submission #598889

#	Time	Username	Problem	Language	Result	Execution time	Memory
598889		pakhomovee	Cave (IOI13_cave)	C++17	100 / 100	790 ms	460 KiB

cave

#include "cave.h"
#include <algorithm>

using namespace std;

void exploreCave(int N) {
    int right[N];
    fill(right, right + N, 0);
    int match[N];
    for (int i = 0; i < N; ++i) {
        int S[N];
        int l = -1, r = N - 1;
        fill(S, S + N, 0);
        for (int j = 0; j < i; ++j) {
            S[match[j]] = right[match[j]];
        }
        int my = 0;
        if (tryCombination(S) == i) {
            my = 1;
        }
        while (l + 1 < r) {
            int m = (l + r) / 2;
            fill(S, S + N, my ^ 1);
            for (int j = 0; j <= m; ++j) {
                S[j] ^= 1;
            }
            for (int j = 0; j < i; ++j) {
                S[match[j]] = right[match[j]];
            }
            if (tryCombination(S) == i) {
                l = m;
            } else {
                r = m;
            }
        }
        match[i] = r;
        right[r] = my;
    }
    int revmatch[N];
    for (int i = 0; i < N; ++i) {
        revmatch[match[i]] = i;
    }
    answer(right, revmatch);
}

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