Submission #786946

#	Time	Username	Problem	Language	Result	Execution time	Memory
786946		drdilyor	동굴 (IOI13_cave)	C++17	13 / 100	445 ms	416 KiB

cave

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

void exploreCave(int n) {
    vector<int> door_of(n, -1);
    for (int i = 0; i < n; i++) {
        int l = -1, r = n-1;
        while (l < r-1) {
            int mid = (l + r) / 2;
            vector<int> comb(n);
            for (int i = 0; i < n;i++) {
                comb[i] = door_of[i] == -1 && i <= mid;
            }
            if (tryCombination(comb.data()) == i) {
                r = mid;
            } else l = mid;
        }
        door_of[r] = i;
    }
    vector<int> zeros(n);
    answer(zeros.data(),door_of.data());
}

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