제출 #1216809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1216809		mariamp1	동굴 (IOI13_cave)	C++20	0 / 100	407 ms	536 KiB

cave

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

void exploreCave(int N){
    vector<int> S(N, 0);
    vector<int> D(N);
    vector<bool> used(N, false);
    for (int door = 0; door < N; ++door) {
        vector<int> test(N, 0);
        for (int i = 0; i < N; ++i)
            if (used[i]) test[i] = S[i];

        int res = tryCombination(test.data());
        int target = (res == -1 || res > door) ? 0 : 1;
        int lo = 0, hi = N - 1, switchIndex = -1;
        while (lo <= hi) {
            int mid = (lo + hi) / 2;
            for (int i = 0; i < N; ++i)
                test[i] = used[i] ? S[i] : target;
            for (int i = lo; i <= mid; ++i)
                if (!used[i]) test[i] = 1 - target;
            res = tryCombination(test.data());
            if (res == -1 || res > door) {
                hi = mid - 1;
                switchIndex = mid;
            } else {
                lo = mid + 1;
            }
        }

        D[door] = switchIndex;
        S[switchIndex] = target;
        used[switchIndex] = true;
    }

    answer(S.data(), D.data());
}

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