제출 #528684

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

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
#define ask(x) tryCombination(x)
 
void exploreCave(int n) {
    int S[n], D[n], a[n];
    bool flag[n]; fill(flag, flag + n, false);
    fill(a, a + n, 0); // query with a, answer with S
    for (int i = 0; i < n; i++) {
        bool f = false, ff = false; 
        int prev = ask(a);
        if (prev == i) S[i] = 1, f = true;
        else S[i] = 0, f = false;
        int l = 0, r = n - 1;
        if (i == 0) cout << prev << "\n";
        while (l < r) {
            int m = (l + r) >> 1;
            for (int j = l; j <= m; j++) if (!flag[j]) a[j] = S[i];
            // if seg of S[i] is closed, it's the other side
            prev = ask(a);
            if (prev == i) ff = true;
            else ff = false;
            for (int j = l; j <= m; j++) if (!flag[j]) a[j] = 0;
            if (f != ff) r = m;
            else l = m + 1;
        }
        flag[l] = true; D[l] = i; a[l] = S[i];
        // cout << S[i] << " " << D[l] << " " << l << " " << "\n";
        // for (int j = 0; j < n; j++) cout << a[j] << " ";
        // cout << "\n\n";
    }
    answer(a, D);
}

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