제출 #311655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
311655		saarang123	동굴 (IOI13_cave)	C++14	0 / 100	36 ms	384 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair

template<class T> bool remin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool remax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
void answer(int s[], int d[]) {
    //int n = sizeof(s)/  sizeof(s[0]);
    cout << "Code: ";
    for(int i = 0; i < 4; i++) cout << s[i] << " "; cout << endl;
    cout << "Doors: ";
    for(int i = 0; i < 4; i++) cout << d[i] << " "; cout << endl;
    cout << "Exit" << endl;
}

int tryCombination(int s[]) {
    //size_t n = (2 * sizeof(s) / sizeof(s[0]));
    cout << "Query for doors: " << sizeof(s) << " " << sizeof(s[0]) << endl;
    for(int i = 0; i < 4; i++) cout << s[i] << " "; cout << endl;
    int x; cin >> x;
    return x;
}
*/

void exploreCave(int n) {
    //cout << n << endl;
    int a[n], s[n], d[n];
    for(int i = 0; i < n; i++)
        a[i] = 0, s[i] = 0, d[i] = -1;
    int x = tryCombination(a);
    while(x != -1) {
        int id;
        int mn = 0, mx = n - 1;
        while(mn < mx) {
            int mid = (mn + mx) >> 1;
            //cout << "Binsearch: " << mn << " " << mid << " " << mx << endl;
            for(int i = mn; i <= mid; i++)
                if(d[i] == -1) a[i] ^= 1;
            int k = tryCombination(a);
            for(int i = mn; i <= mid; i++)
                if(d[i] == -1) a[i] ^= 1;
            if(k != x)
                mx = mid;
            else
                mn = mid + 1;
        }
        id = mn;
        //cout << "Binsearch end: " << id << " " << x << endl; cout << endl;
        d[id] = x;
        a[id] ^= 1;
        x = tryCombination(a);
    }
    for(int i = 0; i < n; i++) s[i] = a[i];
    answer(s, d);
    for(int i = 0; i < n; i++) {
        if(d[i] != -1) continue;
        s[i] ^= 1;
        d[i] = tryCombination(s);
        s[i] ^= 1;
    }
    answer(s, d);
}

/*
signed main() {
    std::ios::sync_with_stdio(0);
    std::cout.tie(0);
    std::cin.tie(0);
    int n, i, j;
    cin >> n;
    exploreCave(n);
    return 0;
}*/

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