제출 #528230

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
528230		happypotato	동굴 (IOI13_cave)	C++17	0 / 100	149 ms	416 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
void exploreCave(int n) {
    vector<int> bit;
    for (int i = 0; i < n; i++) bit.pb(i);
    int S[n], D[n];
    for (int i = 0; i < n; i++) S[i] = 0;
    for (int i = 0; i < n; i++) {
        int res = tryCombination(S);
        bool open = (res >= i + 1);
        if (res == -1) open = true;
        int lb = 0, rb = bit.size() - 1;
        while (lb < rb) {
            int mid = (lb + rb) >> 1;
            for (int j = lb; j <= mid; j++) S[bit[j]] ^= 1;
            int res2 = tryCombination(S);
            bool open2 = (res2 >= i + 1);
            if (res2 == -1) open2 = true;
            for (int j = lb; j <= mid; j++) S[bit[j]] ^= 1;
            if (open == open2) lb = mid + 1;
            else rb = mid;
        }
        D[i] = lb;
        if (!open) S[D[i]] ^= 1;
    }
    answer(S, D);
}

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