Submission #108402

#	Time	Username	Problem	Language	Result	Execution time	Memory
108402		Diuven	Cave (IOI13_cave)	C++14	100 / 100	1501 ms	532 KiB

cave

#include "cave.h"
#include <vector>
using std::vector;

int A[5010], B[5010], n;

int ask(int S[]){
	int res = tryCombination(S);
	return res<0 ? 12345 : res;
}

int ask(int l, int r, int x){
	static int S[5010];
	for(int i=0; i<n; i++)
		S[i] = (A[i]>=0 ? A[i] : (l<=i && i<=r ? x : 1-x));
	return ask(S);
}

void exploreCave(int N) {
	n = N;
	for(int i=0; i<n; i++)
		A[i] = B[i] = -1;


	for(int i=0; i<n; i++){
		// 다 끄고 물어봤을 때, i번째가 열렸으면 0;
		int state = (i>=ask(-1, -1, 1));
		int s=0, e=n-1;
		while(s<e){
			int mid = (s+e)/2;
			if(i<ask(0, mid, state)) e = mid;
			else s = mid+1;
		}
		B[s] = i, A[s] = state;
	}

	answer(A, B);
}

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