제출 #832970

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
832970		HaroldVemeno	동굴 (IOI13_cave)	C++17	100 / 100	177 ms	532 KiB

cave

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

#ifdef GUDEB
    #define D(x) cerr << #x << ": " << (x) << '\n';
    #define ifdeb if(true)
#else
    #define D(x) ;
    #define ifdeb if(false)
#endif

#define all(x) begin(x), end(x)

using namespace std;
using ull = unsigned long long;
using ll = long long;
// #define int ll;

int ind[5000];
int w[5000];

void exploreCave(int N) {
    fill(ind, ind + N, -1);

    for(int i = 0; i < N; ++i) {
        int b = 0;
        int e = N;
        int as = tryCombination(w);
        D(i)
        while(e-b > 1) {
            D(b)
            D(e)
            int m = (b+e)/2;
            for(int j = b; j < m; ++j) {
                if(ind[j] == -1) w[j] = 1-w[j];
            }
            D(as)
            int bs = tryCombination(w);
            if((as == i) == (bs == i)) {
                b = m;
            } else {
                e = m;
            }
            as = bs;
        }
        if(as == i) {
            w[b] = 1-w[b];
        }
        ind[b] = i;
    }
    answer(w, ind);

}

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