Submission #791969

#	Time	Username	Problem	Language	Result	Execution time	Memory
791969		t6twotwo	Cave (IOI13_cave)	C++17	100 / 100	262 ms	468 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int S[N], D[N], A[N]{};
    fill(D, D + N, -1);
    for (int i = 0; i < N; i++) {
        bool f = tryCombination(A) == i;
        int l = 0, r = N - 1;
        while (l < r) {
            int m = (l + r) / 2;
            for (int j = l; j <= m; j++) {
                if (D[j] == -1) {
                    A[j] ^= 1;
                }
            }
            bool g = tryCombination(A) == i;
            for (int j = l; j <= m; j++) {
                if (D[j] == -1) {
                    A[j] ^= 1;
                }
            }
            if (f == g) {
                l = m + 1;
            } else {
                r = m;
            }
        }
        S[l] = i;
        D[l] = f;
        A[l] = f;
    }
    answer(D, S);
}

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