제출 #1150827

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1150827		pinbu	Cave (IOI13_cave)	C++20	100 / 100	587 ms	540 KiB

cave

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

const int MXn = 5005;

int n;
int ask(int a[]) {
    int res = tryCombination(a);
    if (res < 0) res = n;
    return res;
}

int ans[MXn], arr[MXn], pos[MXn]; bool ok[MXn];
void exploreCave(int N) {
    n = N;
    memset(ans, 0, sizeof ans);
    for (int i = 0; i < N; i++) {
        int t = tryCombination(ans) == i ? 0 : 1;
        int l = 0, r = N - 1, mid, res;
        while (l <= r) {
            mid = (l + r) >> 1;
            for (int i = 0; i < N; i++) {
                if (ok[i]) arr[i] = ans[i];
                else if (i <= mid) arr[i] = 1;
            }
            int tmp = ask(arr);
            if (t) {
                if (tmp == i) {
                    res = mid;
                    r = mid - 1;
                } else l = mid + 1;
            } else {
                if (tmp > i) {
                    res = mid;
                    r = mid - 1;
                } else l = mid + 1;
            }
            for (int i = 0; i < N; i++) {
                if (ok[i]) arr[i] = ans[i];
                else if (i <= mid) arr[i] = 0;
            }
        }
        ok[res] = true;
        ans[res] = t ^ 1;
        pos[res] = i;
    }
    answer(ans, pos);
}

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