Submission #570486

#	Time	Username	Problem	Language	Result	Execution time	Memory
570486		franfill	Unscrambling a Messy Bug (IOI16_messy)	C++17	100 / 100	3 ms	468 KiB

messy

#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
string base = "";

std::vector<int> restore_permutation(int n, int w, int r) {
	int P = 0;
	while(1<<P < n) P++;
	//cerr << P << "\n";
	for (int i = 0; i < n; i++) base += "0";
	for (int v = 0; v < n; v++)
	{
		for (int p = 0; p < P; p++) 
		{
			if ((v&(1<<p)) == 0) 
			{
				string query = base;
				for (int i = (v>>(p+1))<<(p+1); (i>>(p+1)) == (v>>(p+1)); i++) if (i != v)
				{
					query[i] = '1';
				}
				add_element(query);
				//cerr << query << "\n";
			}
		}
	}
    compile_set();
	vector < set < int > > ranges(n);
	for (int i = 0; i < n; i++) ranges[0].insert(i);
	for (int p = P-1; p >= 0; p--)
	{
		for (int i = 0; i < n; i += (1<<(p+1)))
		{
			set < int > zeros;		
			set < int > ones = ranges[i];
			string s = base;
			for (auto v : ranges[i])
			{
				s[v] = '1';
			}
			for (auto v : ranges[i])
			{
				s[v] = '0';
				//cerr << "check " << s << "\n";
				if (check_element(s))
				{
					//cerr << "ok\n";
					zeros.insert(v);
					ones.erase(v);
				}
				s[v] = '1';
			}
			ranges[i] = zeros;
			ranges[i+(1<<p)] = ones;
		}
	}
	vector < int > ans(n);
	for (int i = 0; i < n; i++)
	{
		assert(ranges[i].size() == 1);
		ans[*ranges[i].begin()] = i;
	}
	return ans;
}

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