제출 #96274

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96274		figter001	동굴 (IOI13_cave)	C++14	100 / 100	590 ms	640 KiB

cave

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

using namespace std;

typedef long long ll;
const int maxn = 5010;

int s[maxn],d[maxn],f[maxn];

void exploreCave(int n){
	for(int i=0;i<n;i++)f[i] = -1;
    for(int i=0;i<n;i++){
    	for(int j=0;j<n;j++)if(f[j] == -1)s[j] = 0;
    	int to = tryCombination(s);
    	bool ri = 0;
    	if(to == i)ri = 1;
    	for(int j=0;j<n;j++)if(f[j] == -1)s[j] = !ri;
    	int md,lo=0,hi=n-1,at=-1;
    	while(lo <= hi){
    		md = (lo+hi)/2;
    		for(int j=lo;j<=md;j++)if(f[j] == -1)s[j] = ri;
    		to = tryCombination(s);
    		for(int j=lo;j<=md;j++)if(f[j] == -1)s[j] = !ri;
    		if(to == i){
    			lo = md+1;
    		}else{
    			hi = md-1;
    			at = md;
    		}
    	}
    	f[at] = 0;
    	d[at] = i;
    	s[at] = ri;
    }
    answer(s,d);
}

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