제출 #1291346

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

cave

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

bool isDoorOpen(int S[], int i) {
    // If I don't take into account the doors before it
    int result = tryCombination(S);
    if (result != i) {
        return true;
    } else {
        return false;
    }
}

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

    for (int door = 0; door < N; door++) {
        
        for (int i = 0; i < N; i++) {
            if (!used[i]) {
                S[i] = 0;
            }
        }

        int l = 0, r = N - 1, switchIndex = -1;
        bool result1 = isDoorOpen(S, door);
        bool result2 = result1;
        while (l < r) {

            for (int i = 0; i < N; i++) {
                if (!used[i]) {
                    S[i] = 0;
                }
            }
            
            int mid = l + (r - l) / 2;

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

            result2 = isDoorOpen(S, door);
            if (result1 != result2) {
                r = mid;
            } else {
                l = mid + 1;
            }
        }

        D[l] = door;
        if (!result2) {
            S[l] ^= 1;
        }
        used[l] = true;
    }

    answer(S, D);
}

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