제출 #1310702

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310702		aleksandre	Cave (IOI13_cave)	C++20	0 / 100	82 ms	512 KiB

cave

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

void exploreCave(int N) {
    int S[N];
    int P[N];
    for (int i = 0; i < N; i++) {
        S[i] = 0;
        P[i] = -1;
    }
    vector<int> S_unk;
    for (int i = 0; i < N; i++) S_unk.push_back(i);
    while (true) {
        int j = tryCombination(S);
        if (j == -1) break;
        int l = 0, r = S_unk.size() - 1;
        while (l < r) {
            int m = (l + r) / 2;
            for (int k = 0; k <= m; k++)
                S[S_unk[k]] = 1 - S[S_unk[k]];
            int res = tryCombination(S);
            if (res > j) r = m;
            else l = m + 1;
            for (int k = 0; k <= m; k++)
                S[S_unk[k]] = 1 - S[S_unk[k]];
        }
        int idx = S_unk[l];
        S[idx] = 1 - S[idx];
        P[j] = idx;
        S_unk.erase(S_unk.begin() + l);
    }
    answer(S, P);
}

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