제출 #467283

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
467283		xt0r3	동굴 (IOI13_cave)	C++14	100 / 100	265 ms	548 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
using namespace std;

int s[5005], d[5005], fix[5005];
void exploreCave(int N) {
    fill(fix, fix + 5005, -1);
    for(int i = 0; i < N; i++){
        int lo = 0, hi = N - 1;
        int was = tryCombination(s);
        while(lo < hi){
            int mid = (lo + hi) / 2;
            for(int j = lo; j <= mid; j++){
                if(fix[j] == -1){
                    s[j] ^= 1;
                }
            }
            int is = tryCombination(s);
            if((is == i) != (was == i)){
                hi = mid;
            }
            else{
                lo = mid + 1;
            }
            was = is;
        }
        d[lo] = i;
        fix[lo] = (s[lo] ^ ((int)(was == i)));
        s[lo] = fix[lo];
    }
    answer(s, d);
}

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