Submission #470647

#	Time	Username	Problem	Language	Result	Execution time	Memory
470647		PiejanVDC	Cave (IOI13_cave)	C++17	0 / 100	29 ms	332 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int n) {
	int v[n],d[n];
	memset(v,0,sizeof(v));
	vector<bool>used(n,false);
	for(int i = 0 ; i < n ; i++) {
		int last = tryCombination(v);
		int l=0,r=n-1;
		while(l < r) {
			int mid = (l+r)/2;
			for(int j = l ; j <= mid ; j++) {
				if(!used[j]) v[j]^=1;
			}
			int curr = tryCombination(v);
			if((last == i) ^ (curr == i)) {
				r=mid;
			} else l=mid+1;
			last=curr;
		}
		d[i]=l;
		if(last != i) v[i]^=1;
		used[i]=true;
	}
	answer(v,d);
}

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