Submission #137303

#	Time	Username	Problem	Language	Result	Execution time	Memory
137303		GioChkhaidze	Cave (IOI13_cave)	C++14	100 / 100	1344 ms	640 KiB

cave

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

using namespace std;

void exploreCave(int N) {
    int ANS[N],f[N],ANSidx[N];
    
    for (int i=0; i<N; i++) 
    	ANS[i]=0,ANSidx[i]=0,f[i]=0;
    
    for (int i=0; i<N; i++) {
		for (int j=0; j<N; j++) 
			if (!f[j]) ANS[j]=0;
			
		int x=tryCombination(ANS),KO=0;
		if (x==-1) x=N;
		if (x==i) KO=1;

		int l=0,r=N-1,mid,idx=-1;

		while (l<=r) {
	    	mid=(l+r)/2;

	    	for (int j=0; j<=mid; j++)  if (!f[j]) ANS[j]=KO;
			for (int j=mid+1; j<N; j++) if (!f[j]) ANS[j]=1-KO;
	    	
	    	int x=tryCombination(ANS);
	    	if (x==-1) x=N;

	    	if (i<x) { idx=mid; r=mid-1; }
	    				   else l=mid+1;
		}
	
		ANS[idx]=KO,ANSidx[idx]=i;
		f[idx]=1;
	}

    answer(ANS,ANSidx);
    return ;
}

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