제출 #231253

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
231253		islingr	Unscrambling a Messy Bug (IOI16_messy)	C++14	100 / 100	6 ms	640 KiB

messy

#include "messy.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
 
using namespace std;
 
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
 
bool ask(string &s, int i) {
	s[i] = '1';
	bool b = check_element(s);
	s[i] = '0';
	return b;
}
void add(string &s, int i) { s[i] = '1'; add_element(s); s[i] = '0'; }
 
vector<int> restore_permutation(int n, int _, int __) {
	for (int sz = n; sz != 1; sz >>= 1) {
		for (int l = 0; l != n; l += sz) {
			string s(n, '1');
			rep(i, l, l + sz) s[i] = '0';
			rep(i, l, l + sz / 2) add(s, i);
		}
	}
 
	compile_set();
	
	vector<int> p(n); iota(all(p), 0);
	for (int sz = n; sz != 1; sz >>= 1) {
		vector<bool> v(n);
		for (int l = 0; l != n; l += sz) {
			string s(n, '1');
			rep(i, l, l + sz) s[p[i]] = '0';
			rep(i, l, l + sz) v[p[i]] = ask(s, p[i]);
			partition(begin(p) + l, begin(p) + l + sz, [&v](int x) { return v[x]; });
		}
	}

	vector<int> res(n);
	rep(i, 0, n) res[p[i]] = i;
	return res;
}

• Subtask 1: 20 / 20
• Subtask 2: 18 / 18
• Subtask 3: 11 / 11
• Subtask 4: 21 / 21
• Subtask 5: 30 / 30