제출 #550609

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
550609		Olympia	동굴 (IOI13_cave)	C++17	51 / 100	443 ms	512 KiB

cave

#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <cassert>
#include <map>
#include <complex>
#include <cmath>
#include <set>
#include "cave.h"
using namespace std;
void exploreCave (int n) {
    vector<pair<int,bool>> vec;
    int c[n]; int arr[n];
    for (int i = 0; i < n; i++) {
        int a[n];
        for (int j = 0; j < n; j++) {
            a[j] = true;
        }
        for (auto& p: vec) a[p.first] = p.second;
        bool b = (tryCombination(a) >= i + 1 || tryCombination(a) == -1);
        int l = 0;
        int r = n - 1;
        while (l != r) {
            int m = (l + r)/2;
            for (int j = 0; j < n; j++) a[j] = !b;
            for (int j = 0; j <= m; j++) a[j] = b;
            for (auto& p: vec) a[p.first] = p.second;
            if (tryCombination(a) >= i + 1 || tryCombination(a) == -1) {
                r = m;
            } else {
                l = m + 1;
            }
        }
        arr[l] = i;
        vec.emplace_back(l, b);
    }
    for (auto& p: vec) {
        c[p.first] = p.second;
    }
    answer(c, arr);
}

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