제출 #1289007

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289007		hiddenmeanings	동굴 (IOI13_cave)	C++20	0 / 100	2 ms	340 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] = {0};

        // Try each unused switch to find which one controls this door
        for (int i = 0; i < N; i++) {
            if (used[i]) {
                comb[i] = S[i]; // already known state
            } else {
                comb[i] = 0; // test with switch i off
            }
        }

        int failingDoor = tryCombination(comb);

        int switchIndex = -1;
        for (int i = 0; i < N; i++) {
            if (used[i]) continue;

            comb[i] = 1;
            failingDoor = tryCombination(comb);
            if (failingDoor == door) {
                switchIndex = i;
                S[i] = 1;
                break;
            }
            comb[i] = 0;
            failingDoor = tryCombination(comb);
            if (failingDoor == door) {
                switchIndex = i;
                S[i] = 0;
                break;
            }
        }

        D[switchIndex] = door;
        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