Submission #791046

#	Time	Username	Problem	Language	Result	Execution time	Memory
791046		khshg	Unscrambling a Messy Bug (IOI16_messy)	C++14	0 / 100	2071 ms	724 KiB

messy

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

vector<int> restore_permutation(int N, int W, int R) {
	int B = __lg(N);
	for(int i = 0; i < B; ++i) {
		string S(N, '0');
		for(int j = 0; j <= i; ++j) {
			S[j] = '1';
		}
		add_element(S);
	}
	for(int i = B - 1; i >= 0; --i) {
		string S(N, '0');
		S[B - i - 1] = '1';
		for(int j = B; j < N; ++j) {
			if(j % (1 << (i + 1)) < (1 << i)) {
				S[j] = '1';
				add_element(S);
				S[j] = '0';
			}
		}
	}
	compile_set();
	vector<int> P(N, -1);
	for(int i = 0; i < B; ++i) {
		string S(N, '0');
		for(int j = 0; j < i; ++j) S[P[j]] = '1';
		for(int j = 0; j < N; ++j) {
			if(S[j] == '1') continue;
			S[j] = '1';
			if(!check_element(S)) {
				S[j] = '0';
				continue;
			}
			P[i] = j;
			break;
		}
	}
	string og(N, '0');
	for(int i = 0; i < B; ++i) og[P[i]] = '1';
	for(int i = 0; i < N; ++i) {
		if (og[i] == '1') continue;
		int k = 0;
		string S(N, '0');
		S[i] = '1';
		for(int j = 0; j < B; ++j) {
			if (P[j] == -1) {
				while (1) {};
			}
			S[P[j]] = '1';
			if (!check_element(S)) {
				k += 1 << (B - j - 1);
			}
			S[P[j]] = '0';
		}
		P[k] = i;
	}
	vector<int> ans(N);
	for(int i = 0; i < N; ++i) {
		//ans[P[i]] = i;
	}
	return ans;
}

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