Submission #1216794

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216794		takoshanava	Cave (IOI13_cave)	C++20	0 / 100	144 ms	536 KiB

cave

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

int R[5000], D[5000];
bool vis[5000];

void exploreCave(int N) {
    for (int i = 0; i < N; i++) {
        R[i] = 0;
        D[i] = 0;
        vis[i] = false;
    }

    for (int j = 0; j < N; j++) {
        int l = 0, r = N - 1, idx = -1;

        while (l <= r) {
            int mid = (l + r) / 2;

            int tmp[5000];
            for (int i = 0; i < N; i++)
                tmp[i] = R[i];

            for (int i = l; i <= mid; i++){
                if (!vis[i]){
                    tmp[i] = 1 - tmp[i];
                }
            }

            int res = tryCombination(tmp);

            if (res == -1 or res > j) {
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }

        idx = l;
        vis[idx] = true;
        R[idx] = 0;
        int res = tryCombination(R);
        if (res != -1 and res <= j){
            R[idx] = 1;
        }

        D[idx] = j;
    }

    answer(R, D);
}

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