제출 #331279

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
331279		smax	동굴 (IOI13_cave)	C++17	100 / 100	1164 ms	656 KiB

cave

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

void exploreCave(int N) {
    vector<int> state(N), connect(N, N);
    for (int i=0; i<N; i++) {
        vector<int> guess(N);
        for (int j=0; j<N; j++) {
            if (connect[j] < i)
                guess[j] = state[j];
        }
        bool x = tryCombination(&guess[0]) == i;
        int l = 0, r = N;
        while (l < r) {
            int m = (l + r) / 2;
            for (int j=0; j<N; j++) {
                if (connect[j] < i)
                    guess[j] = state[j];
                else if (j < l || j >= r)
                    guess[j] = 0;
                else
                    guess[j] = j <= m;
            }
            bool y = tryCombination(&guess[0]) == i;
            if (x == y)
                l = m + 1;
            else
                r = m;
        }
        state[l] = x;
        connect[l] = i;
    }
    answer(&state[0], &connect[0]);
}

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