제출 #791267

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
791267		Bula	동굴 (IOI13_cave)	C++14	100 / 100	188 ms	528 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
//#define int ll
const ll mod=1e9+7,N=5005;
int c[N],d[N],t[N],cur[N];
 
void exploreCave(int n){
	for(int i=0;i<n;i++){
		c[i] = 1;
		t[i] = 0;
	}
	int p = tryCombination(c);
	if (p == -1) p = n;
	for (int i = 0 ; i < n; i++){
        p = tryCombination(c);
	    if (p == -1) p = n;
		int l = 0, r = n - 1;
		while(l < r){
			int m = (l + r) / 2;
			for(int j = 0; j < n ; j++) cur[j] = c[j];
			for(int j = l; j <= m; j++){
				if(t[j] == 0) cur[j] = 0;
			}
			int k = tryCombination(cur);
			if(k == -1) k = n;
			
			if(p > i){
				if(k <= i) r = m;
				else l = m + 1;
			}else{
				if(k > i) r = m;
				else l = m + 1;
			}
		}
		t[l] = 1;
		d[l] = i;
		if(p > i) c[l] = 1;
		else c[l] = 0;
	}
	
	answer(c,d);
}

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