제출 #414069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
414069		illyakr	동굴 (IOI13_cave)	C++14	100 / 100	300 ms	668 KiB

cave

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

int S[101010];
int D[101010];
bool dont[101010];
void sw(int l, int r) {
    for (int i = l; i <= r; i++) {
        if (dont[i])continue;
        S[i] ^= 1;
    }
}
void exploreCave(int N) {
//    cout << "START  " << N << endl;
    for (int i = 0; i < N; i++) {
//        cout << i << " <<!!!!! " << endl;
        int gg = tryCombination(S);
        if (gg == -1 || gg > i);
        else sw(0, N - 1);
//        for (int j = 0; j < N; j++)cout << S[j] << " ";
//        cout << endl;
        int l = 0, r = N - 1;
        while (l < r) {
            int mid = (l + r) / 2;
            sw(l, mid);
            gg = tryCombination(S);
            if (gg == -1 || gg > i)l = mid + 1;
            else {
                sw(l, mid);
                r = mid;
            }
        }
//        cout << i << " --- " << l << " " << r << endl;
        D[l] = i;
        dont[l] = true;
    }
//    cout << "END" << endl;
//    for (int i = 0; i < N; i++)
//        cout << S[i] << " ";
//    cout << endl;
//    for (int i = 0; i < N; i++)
//        cout << D[i] << " ";
//    cout << endl;
    answer(S, D);
}

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