제출 #167965

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

cave

# include <bits/stdc++.h>
# include "cave.h"
using namespace std;
int n,pr[100005],x[100005],le,ri,mid,pre[1000005],k,ans[1000005],idx,w;
void exploreCave(int N)
{
	n=N;
	for (int i=0; i<n; i++)
	pre[i]=-1;
	for (int i=0; i<n; i++)
	{
		for (int j=0; j<n; j++)
		{
			if (pre[i]==-1) 
			x[i]=1;
			else
			x[i]=pre[i];
		}
		 idx=tryCombination(x);
		if (idx>i || idx==-1) 
		k=1;
		else k=0;
		le=0;
		ri=n-1;
		while (le<ri)
		{
			mid=(le+ri)/2;
			for (int j=le; j<=mid; j++)
			{
				if(pre[i]==-1) x[i]=k;
				else x[i]=pre[i];
			}
			for(int j=0; j<le; j++) 
			{
				if (pre[j]==-1)
				{
					if (k==1)
					{
						x[j]=0;
					}
					else
					x[j]=1;
				}
				else
				x[j]=pre[j];
			}
			for (int j=mid+1; j<n; j++)
			{
				if (pre[j]==-1)
				{
					if (k==1)
					{
						x[j]=0;
					}
					else
					x[j]=1;
				}
				else
				x[j]=pre[j];
			}
    		 idx=tryCombination(x);
    	if(idx>i || idx==-1)
    		ri=mid;
			else
			le=mid+1;
		}
		mid=(le+ri)/2;
		w=mid;
		ans[mid]=i;
		pre[mid]=k;
	}
	answer(pr,ans);
}

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