Submission #482026

#	Time	Username	Problem	Language	Result	Execution time	Memory
482026		glome	Cave (IOI13_cave)	C++17	0 / 100	467 ms	388 KiB

cave

#include "cave.h"
#include<bits/stdc++.h>

using namespace std;
void exploreCave(int N) {
	int what[N];
	int where[N];
	bool ok[N];
	for (int i = 0; i<N; i++) {	
		int k = tryCombination(what);
		int now = 0;
		if(k == -1 || k == i) {
			now = 1;
		}
		int l = 0, r = N - 1;
		int pos;
		while(l < r) {	
			int temp[N];
			int l1 = 0, r1 = (l + r + 1) / 2;
			int l2 = (l + r + 1) / 2 + 1, r2 = r;
			for (int j = 0; j<N; j++) {
				if(ok[j]) {
					temp[j] = what[j];
					continue;
				}
				if(j >= l2 && j <= r2) {
					temp[j] = now;
				}	
				else {
					temp[j] = now ^ 1;
				}
			}
			int lx = tryCombination(temp);
			if(lx == -1 || lx == i) {
				l = l1, r = r1;
			}
			else {
				l = l2, r = r2;
			}
		}
		pos = l;
		what[pos] = now;
		where[i] = pos;
		ok[pos] = 1;
	}
	answer(what, where);
}

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