Submission #593356

#	Time	Username	Problem	Language	Result	Execution time	Memory
593356		shezitt	Cave (IOI13_cave)	C++14	0 / 100	347 ms	372 KiB

cave

#include "cave.h"
#include <iostream>
#include <algorithm>
#include <cstring>
#include <set>
 
using namespace std;
 
void exploreCave(int N) {
	int a[N], b[N];
	for(int i=0; i<N; ++i){
		a[i] = 0;
		b[i] = -1;
	}
	for(int i=0; i<N; ++i){
		int p = a[i];
		if(tryCombination(a) == 0){   
			p = a[i] = !a[i];   
		} 
		int l = 0, r = N-1;
		while(l < r){
			int mid = l+(r-l)/2;
			for(int j=i; j<N; ++j){
				a[j] = (j >= l && j <= mid);
			}
			if(tryCombination(a) != 0){
				r = mid;
			} else {
				l = mid+1;
			}
		}
		a[i] = p;
		b[i] = l;
	}
	answer(a, b);
}

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