Submission #705992

#	Time	Username	Problem	Language	Result	Execution time	Memory
705992		Nonoze	Cave (IOI13_cave)	C++14	0 / 100	547 ms	408 KiB

cave

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

void exploreCave(int N) {
	int S[N], D[N];
	for (int i = 0; i < N; ++i)
	{
		S[i]=0, D[i]=0;
	}
	int comp=-1;
	for (int i = 0; i < N; ++i)
	{
		int *s_new=S;
		int remplacer=1;
		if (tryCombination(S)>comp)
		{
			for (int j = 0; j < N; ++j)
			{
				if (D[j]==-1)
				{
					s_new[i]=1;
				}
			}
			remplacer=0;
		}
		int l=0, r=N;
		while(l<r) {
			int mid=(l+r)/2;
			for (int j = 0; j < mid; ++j)
			{
				if (D[j]==-1)
				{
					s_new[i]=remplacer;
				}
			}
			if (tryCombination(s_new)>comp) {
				r=mid+1;
			}
			else {
				l=mid;
			}
			s_new=S;
		}
		S[l]=remplacer;
		S[l]=i;
	}
	answer(S, D);
}

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