제출 #560025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
560025		ngpin04	동굴 (IOI13_cave)	C++14	51 / 100	499 ms	656 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
const int N = 1e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

#define ask tryCombination

int d[N], q[N], s[N];
#define getbit(x, i) ((x >> i) & 1)
#define bit(x) (1LL << x);

void exploreCave(int n) {
    vector <bool> ok(n, 1);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++)
            q[j] = (ok[j]) ? 0 : d[j];

        int val = (ask(q) == i);
        cerr << val << "\n";
        int res = 0;
        for (int b = 0; b < 14; b++) {
            for (int j = 0; j < n; j++) 
                q[j] = (ok[j]) ? (getbit(j, b) ^ val) : d[j];

            if (ask(q) == i)
                res |= bit(b);
        }

        s[res] = i;
        d[res] = val;
        ok[res] = false;
    }   

    answer(d, s);
}   

//#include "grader.c"

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