제출 #308998

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308998		tengiz05	Unscrambling a Messy Bug (IOI16_messy)	C++17	100 / 100	2 ms	544 KiB

messy

#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
int ng;
void build(int l, int r){
	if(l == r)return;
	string s(ng, '1');
	for(int i=l;i<=r;i++){
		s[i] = '0';
	}int mid = (l+r)>>1;
	for(int i=l;i<=mid;i++){
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}
	build(l, mid);
	build(mid+1, r);
}
void find_ans(int l, int r, vector<int> v, vector<int> &ans){
	if(l == r){
		ans[v[0]] = l;
		return;
	}string s(ng, '1');
	for(auto x : v)s[x] = '0';
	vector<int> L, R;
	for(int i=l;i<=r;i++){
		s[v[i-l]] = '1';
		if(check_element(s)){
			L.push_back(v[i-l]);
		}else {
			R.push_back(v[i-l]);
		}s[v[i-l]] = '0';
	}
	int mid = (l+r)>>1;
	find_ans(l, mid, L, ans);
	find_ans(mid+1, r,R,ans);
}
vector<int> restore_permutation(int N, int w, int r) {
	ng = N;
	build(0, ng-1);
	compile_set();
	vector<int> ans(ng);
	vector<int> v;
	for(int i=0;i<ng;i++)v.push_back(i);
	find_ans(0, ng-1, v, ans);
	return ans;
}

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