Submission #157282

#	Time	Username	Problem	Language	Result	Execution time	Memory
157282		ZikXewen	동굴 (IOI13_cave)	C++11	0 / 100	264 ms	512 KiB

cave

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

void exploreCave(int N){
	int st[N], nw[N], co[N];
	vector<int> lf(N);
	iota(lf.begin(), lf.end(), 0);
	for(int te = tryCombination(st); te != -1; te = tryCombination(st)) st[te] = 1; 
	for(int i = 0; i < N; i++) {
		int l = 0, r = lf.size() - 1;
		while(l < r) {
			int m = (l + r) >> 1;
			copy(st, st + N, nw);
			for(int j = l; j <= m; j++) nw[j] = !st[lf[j]];
			if(tryCombination(nw) == i) r = m;
			else l = m + 1;
		}
		co[lf[l]] = i;
		lf.erase(lf.begin() + l);
	}
	answer(st, co);
}

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