제출 #417493

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
417493		dxz05	동굴 (IOI13_cave)	C++14	12 / 100	386 ms	544 KiB

cave

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

using namespace std;

int calls = 0;
int ask(int comb[]){
    calls++;
    assert(calls <= 70000);
    return tryCombination(comb);
}

void exploreCave(int N) {
    int comb[N], S[N], D[N];
    fill(S, S + N, -1);

    vector<int> free;
    for (int i = 0; i < N; i++) free.push_back(i);

    for (int i = 0; i < N; i++){
        int ind = 0;

        for (int j = 0; j < N; j++){
            comb[j] = (S[j] != -1 ? S[j] : 0);
        }

        int last = ask(comb);
        int x = (last == i && last != -1);

        int l = 0, r = free.size() - 1;
        while (l <= r){
            int mid = (l + r) >> 1;

            for (int j = 0; j < N; j++){
                comb[j] = (S[j] != -1 ? S[j] : (x ^ 1));
            }

            comb[free[mid]] = x;

            if (ask(comb) != i){
                ind = mid;
                r = mid - 1;
            } else l = mid + 1;

        }

        int pos = free[ind];

        S[pos] = x;
        D[pos] = i;

        //cout << x << ' ' << pos << endl;

        free.erase(free.begin() + ind, free.begin() + ind + 1);

    }

    answer(S, D);
}

/*
4
1 1 1 0
3 1 0 2

5
0 1 0 1 0
2 4 0 1 3
*/

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