Submission #481726

#	Time	Username	Problem	Language	Result	Execution time	Memory
481726		Spade1	동굴 (IOI13_cave)	C++14	100 / 100	883 ms	536 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
using namespace std;

bool mark[5050];
int a[5050], swtch[5050];

void exploreCave(int N) {
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            if (!mark[j]) a[j] = 0;
        }

        int open = (tryCombination(a) == i ? 1 : 0);

        int l = 0, r = N - 1;
        while (l < r) {
            int mid = (l + r)/2;
            for (int j = 0; j <= mid; ++j) {
                if (!mark[j]) a[j] = open;
            }
            for (int j = mid + 1; j < N; ++j) {
                if (!mark[j]) a[j] = 1 - open;
            }
            if (tryCombination(a) == i) {
                l = mid + 1;
            }
            else {
                r = mid;
            }
        }
        swtch[l] = i;
        mark[l] = 1;
        a[l] = open;
    }
    answer(a, swtch);
}

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