제출 #1202090

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1202090		totoro	동굴 (IOI13_cave)	C++20	100 / 100	121 ms	532 KiB

cave

#include "cave.h"

#include <iostream>
#include <vector>

void exploreCave(int N) {
    std::vector<int> matchesto(N);
    std::vector<int> fixed(N);
    for (int i = 0; i < N; ++i) {
        int lo = 0, hi = N - 1;
        std::vector<int> S(N);
        for (int j = 0; j < N; ++j) {
            if (fixed[j])
                S[j] = fixed[j] - 1;
            else
                S[j] = 1;
        }
        // for (int k : S) {
        //     std::cout << k << ' ';
        // }
        // std::cout << '\n';
        int last = (tryCombination(S.data()) == i);
        while (lo < hi) {
            int mid = (lo + hi) / 2;
            for (int j = lo; j <= mid; ++j) {
                if (fixed[j])
                    S[j] = fixed[j] - 1;
                else
                    S[j] ^= 1;
            }

            int now = (tryCombination(S.data()) == i);
            if (now == last)
                lo = mid + 1;
            else
                hi = mid;
            last = now;
        }
        matchesto[lo] = i;
        fixed[lo] = (S[lo] ^ last) + 1;
    }

    for (int& i : fixed) --i;

    answer(fixed.data(), matchesto.data());
}

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