제출 #964524

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
964524		UmairAhmadMirza	동굴 (IOI13_cave)	C++14	100 / 100	629 ms	820 KiB

cave

#include <bits/stdc++.h>
#include <cave.h>
using namespace std;
int const NN=5e3+3;
int swit[NN];
bool com[NN];
int door[NN];
int n;
void exploreCave(int N){
	n=N;
	int S[N],K[N];
	for (int i = 0; i < n; ++i){
		S[i]=0;
		K[i]=0;
	}
	for (int i = 0; i < n; ++i)
	{
		//find comb
		int cl=tryCombination(S);
		if(cl==i)
			com[i]=1;
		int low=0,high=n;
		while(high-low>1){
			int mid=(low+high)/2;
			for (int j = 0; j < n; ++j){
				if(swit[j]>0)
					continue;
				if(low<=j&&j<mid)
					K[j]=com[i];
				else
					K[j]=!(com[i]);
			}
			int v=tryCombination(K);
			if(v==i)
				low=mid;
			else
				high=mid;
		}
		swit[low]=i+1;
		door[i]=low;
		S[low]=com[i];
		K[low]=com[i];
		// break;
	}
	for (int i = 0; i < N; ++i)
		swit[i]--;
	answer(S,swit);
}

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