Submission #339566

#	Time	Username	Problem	Language	Result	Execution time	Memory
339566		ogibogi2004	Cave (IOI13_cave)	C++14	0 / 100	228 ms	620 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int b[N];
    bool locked[N];
    int s[N],d[N];
    vector<int>unlocked;
    memset(locked,0,sizeof(locked));
    for(int i=0;i<N;i++)
    {
		unlocked.clear();
		for(int j=0;j<N;j++)
		{
			if(!locked[j])
			{
				b[j]=0;
				unlocked.push_back(j);
			}
		}
		int xd=tryCombination(b);
		if(xd==i)
		{
			int low=0,high=unlocked.size()-1,mid,ans=0;
			while(low<=high)
			{
				mid=(low+high)/2;
				for(int j=0;j<(int)unlocked.size();j++)
				{
					if(j<=mid)b[j]=0;
					else b[j]=1;
				}
				int r=tryCombination(b);
				if(r==i)
				{
					ans=mid;
					high=mid-1;
				}
				else low=mid+1;
			}
			b[unlocked[ans]]=1;
			locked[unlocked[ans]]=1;
			s[unlocked[ans]]=1;
			d[unlocked[ans]]=i;
		}
		else
		{
			int low=0,high=unlocked.size()-1,mid,ans=0;
			while(low<=high)
			{
				mid=(low+high)/2;
				for(int j=0;j<(int)unlocked.size();j++)
				{
					if(j<=mid)b[j]=1;
					else b[j]=0;
				}
				int r=tryCombination(b);
				if(r==i)
				{
					ans=mid;
					high=mid-1;
				}
				else low=mid+1;
			}
			b[unlocked[ans]]=0;
			locked[unlocked[ans]]=1;
			s[unlocked[ans]]=0;
			d[unlocked[ans]]=i;
		}
	}
	answer(s,d);
}

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