Submission #741896

#	Time	Username	Problem	Language	Result	Execution time	Memory
741896		thinknoexit	Cave (IOI13_cave)	C++17	0 / 100	521 ms	376 KiB

cave

#include "cave.h"

void exploreCave(int n) {
    int a[n], b[n];
    int t[n];
    for (int i = 0;i < n;i++) {
        a[i] = -1;
        b[i] = -1;
    }
    for (int k = 0;k < n;k++) {
        for (int i = 0;i < n;i++) {
            if (a[i] != -1) t[i] = 0;
            else t[i] = a[i];
        }
        int aa = tryCombination(t), f;
        if (aa == -1 || aa > k) f = 0;
        else f = 1;
        int l = 0, r = n - 1;
        while (l < r) {
            int mid = (l + r) / 2;
            for (int i = 0;i < n;i++) {
                if (a[i] != -1) t[i] = a[i];
                else if (i >= l && i <= mid) t[i] = f;
                else t[i] = 1 - f;
            }
            int ans = tryCombination(t);
            if (ans == -1 || ans > k) r = mid;
            else l = mid + 1;
        }
        a[l] = f;
        b[l] = k;
    }
    answer(a, b);
}

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