Submission #158020

#	Time	Username	Problem	Language	Result	Execution time	Memory
158020		NachoLibre	동굴 (IOI13_cave)	C++14	0 / 100	585 ms	512 KiB

cave

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

int n;
bool vp[5003], am;

int tos(int l, int r, bool st, int s[]) {
	for(int i = 0; i < n; ++i) {
		if(!vp[i]) s[i] = st ^ (i < l || i > r);
	}
	return tryCombination(s);
}

void exploreCave(int N) {
	int s[N], d[N];
	n = N;
	for(int i = 0; i < n; ++i) {
		if(tos(0, n - 1, 0, s) != i) am = 1;
		else am = 0;
		int l = 0, r = n - 1, m;
		while(l < r) {
			m = (l + r) / 2;
			if(tos(l, m, am, s) == i) {
				r = m;
			} else {
				l = m + 1;
			}
		}
		vp[l] = 1;
		d[l] = i;
		s[l] = am;
	}
	answer(s, d);
	return;
}

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