제출 #1243653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1243653		lacito	Cave (IOI13_cave)	C++17	13 / 100	215 ms	512 KiB

cave

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

void exploreCave(int n) {
    int s[n];
    vector<int> switch_of_door(n, -1);
    for (int door = 0; door < n; door++) {
        int l = 0, r = n; // l <= answer < r
        while (r - l > 1) {
            int mid = (l + r) / 2;
            for (int i = 0; i < n; i++) s[i] = 0;
            for (int i = l; i < mid; i++) s[i] = 1;
            for (int j = 0; j < door; j++) s[switch_of_door[j]] = 0;
            int closed = tryCombination(s);
            // for (int i = 0; i < n; i++) cout << s[i];
            // cout << " -> " << closed << "\n";
            if (closed == door) {
                r = mid;
            } else {
                l = mid;
            }
        }
        switch_of_door[door] = l;
        // cout << "Switch of door " << door << ": " << l << "\n";
    }
    
    for (int i = 0; i < n; i++) s[i] = 0;
    int d[n];
    for (int i = 0; i < n; i++) {
        d[switch_of_door[i]] = i;
    }
    answer(s, d);
}

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