제출 #1283582

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

cave

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

void exploreCave(int N) {
    int S[N], D[N];
    bool used[N] = {false};

    for (int door = 0; door < N; door++) {
        int comb[N];
        
        for (int i = 0; i < N; i++) {
            comb[i] = used[i] ? S[i] : 0;
        }

        int l = 0, r = N - 1, switchIndex = -1;

        while (l <= r) {
            int mid = l + (r - l) / 2;

            for (int i = 0; i < N; i++) {
                comb[i] = used[i] ? S[i] : 0;
            }

            for (int i = l; i <= mid; i++) {
                if (!used[i]) comb[i] = 1;
            }

            if (tryCombination(comb) == door || tryCombination(comb) == -1) {
                switchIndex = mid;
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        
        comb[switchIndex] = 0;
        if (tryCombination(comb) == door) {
            comb[switchIndex] = 1;
        } 

        D[switchIndex] = door;
        S[switchIndex] = comb[switchIndex];
        used[switchIndex] = true;
    }
    answer(S, D);
}

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