Submission #125252

#	Time	Username	Problem	Language	Result	Execution time	Memory
125252		khulegub	Cave (IOI13_cave)	C++14	0 / 100	39 ms	384 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
int n;
int start;
int uz[5005];
int s[5005], d[5005];
void soli(int l, int r){
	for (int i = l; i <= r; i++) uz[i] = (uz[i] ? 0 : 1); 
}
void exploreCave(int N) {
	n = N;
	memset(uz, 0, sizeof uz);
	for (int i = 0; i < n; i++){
		start = i;
		if (tryCombination(uz) < i) soli(i, n - 1);
		s[i] = uz[i];
		// now uz is guaranteed to produce i<=
		int l = i, r = n - 1;
		while (l != r){
			int mid = (l + r) >> 1;
			soli(l, mid);
			int tmp = tryCombination(uz);
			soli(l, mid);
			if(tmp >= i){ //zuun tald
				r = mid;
			}
			else{ //baruun tald
				l = mid + 1;
			}	
		}
		d[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