Submission #333548

#	Time	Username	Problem	Language	Result	Execution time	Memory
333548		LucaDantas	동굴 (IOI13_cave)	C++17	100 / 100	242 ms	748 KiB

cave

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

#define pb push_back

constexpr int maxn = 5010;

int correspond[maxn], a[maxn], state[maxn];

vector<int> livre;

void exploreCave(int n) {
	for(int i = 0; i < n; i++)
		livre.pb(i);
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < n; j++)
			a[j] = state[j];
		int now = tryCombination(a);
		now = now>i||now==-1;
		int l = 0, r = n-1-i;
		while(l < r) {
			int m = (l+r) >> 1;
			for(int j = l; j <= m; j++)
				a[livre[j]] ^= 1;
			int opa = tryCombination(a);
			opa = opa>i||opa==-1;
			if(opa != now)
				r = m, now = opa;
			else l = m+1;
		}
		correspond[livre[l]] = i;
		state[livre[l]] = 1^now^a[livre[l]];
		livre.erase(find(livre.begin(), livre.end(), livre[l]));
	}
	answer(state, correspond);
}

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