Submission #1042144

#	Time	Username	Problem	Language	Result	Execution time	Memory
1042144		blackslex	Cave (IOI13_cave)	C++17	100 / 100	256 ms	608 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>

using namespace std;

void exploreCave(int N) {
    int D[N] = {}, val[N] = {}, pos[N] = {}, revpos[N] = {};
    for (int i = 0; i < N; i++) D[i] = val[i] = 0;
    for (int i = 0; i < N; i++) {
        int ct = tryCombination(val);
        if (ct > i || !(~ct)) {
            int l = 0, r = N - 1;
            while (l < r) {
                int mid = (l + r) >> 1;
                for (int j = 0; j <= mid; j++) D[j] = 0;
                for (int j = mid + 1; j < N; j++) D[j] = 1;
                for (int j = 0; j < i; j++) D[pos[j]] = val[pos[j]];
                int cval = tryCombination(D);
                if (cval > i || !(~cval)) r = mid;
                else l = mid + 1;
            }
            pos[i] = l; revpos[l] = i;
        } else {
            int l = 0, r = N - 1;
            while (l < r) {
                int mid = (l + r) >> 1;
                for (int j = 0; j <= mid; j++) D[j] = 1;
                for (int j = mid + 1; j < N; j++) D[j] = 0;
                for (int j = 0; j < i; j++) D[pos[j]] = val[pos[j]];
                int cval = tryCombination(D);
                if (cval > i || !(~cval)) r = mid;
                else l = mid + 1;
            }
            pos[i] = l; revpos[l] = i; val[l] = 1;
        }
    }
    answer(val, revpos);
}

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