Submission #593366

#	Time	Username	Problem	Language	Result	Execution time	Memory
593366		shezitt	Cave (IOI13_cave)	C++14	0 / 100	423 ms	384 KiB

cave

#include "cave.h"
#include <iostream>
#include <algorithm>
#include <cstring>
#include <set>

using namespace std;

const int mxN = 5e3+5;
int a[mxN], b[mxN];
bool done[mxN];

int f(int x, int l, int r, int p, int n){
	if(l == r){
		return l;	
	}
	int mid = l+(r-l)/2;
	for(int i=0; i<n; ++i){
		if(done[i]){
			continue;
		}
		a[i] = (i >= l && i <= mid);
	}
	if(tryCombination(a) != x){
		return f(x, l, mid, p, n); 
	} else {
		return f(x, mid+1, r, p, n);
	}
}

void exploreCave(int N) {
	for(int i=0; i<N; ++i){
		a[i] = done[i] = 0;
		b[i] = -1;
	}
	for(int i=0; i<N; ++i){
		int p = a[i];
		if(tryCombination(a) == i){   
			p = a[i] = !a[i];   
		} 
		b[i] = f(i, 0, N-1, p, N);
		done[i] = 1;
	}
	answer(a, b);
}

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