Submission #882326

#	Time	Username	Problem	Language	Result	Execution time	Memory
882326		dubabuba	Cave (IOI13_cave)	C++14	0 / 100	2053 ms	348 KiB

cave

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

const int mxn = 5050;
using namespace std;

void exploreCave(int N) {
	int d[N], id[N];
	for(int i = 0; i < N; i++)
		id[i] = i;

	memset(d, 0, sizeof d);
	auto rev = [&](int l, int r) {
		for(int i = l; i <= r; l++)
			d[i] = 1 - d[i];
	};

	int las = -1;
	while(1) {
		int i = tryCombination(d);
		if(i == -1) break;

		las = max(las, i);
		if(las * 2 >= N) rev(las + 1, N - 1);
		else rev(las + 1, las * 2);
		
		int j = tryCombination(d);
		if(j == -1) break;
		las = j + 1;
		d[j + 1] = 1 - d[j + 1];
	}

	answer(d, id);
}

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