Submission #969220

#	Time	Username	Problem	Language	Result	Execution time	Memory
969220		Fyx	Cave (IOI13_cave)	C++14	100 / 100	534 ms	696 KiB

cave

#include "cave.h"

void exploreCave(int N) {
    int a[N];
    int b[N];
    for (int i = 0; i < N; i++)a[i] = 0;
    for (int i = 0; i < N; i++)b[i] = -1;
    int check;
    for (int i = 0; i < N; i++) {
        check = tryCombination(a);
        if (check == i) {
            for (int j = 0; j < N; j++) if (b[j] == -1) a[j] ^= 1;
        }
        int l = 0, r = N - 1, ans = N - 1;
        while (l <= r) {
            int m = (l + r) >> 1;
            for (int j = 0; j <= m; j++) if (b[j] == -1) a[j] ^= 1;
            check = tryCombination(a);
            for (int j = 0; j <= m; j++)if (b[j] == -1) a[j] ^= 1;
            if (check == i) {
                ans = m;
                r = m - 1;
            } else {
                l = m + 1;
            }
        }
        b[ans] = i;
    }
    answer(a, b);
    
}

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