제출 #293284

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

messy

#include <vector>
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

vector< int > ans;

int n;

void build(int left, int right){
	if(left == right) return;
	int mid = (left+right)/2;
	
	string v(n,'1');
	for(int i = left; i <= right; i++){
		v[i] = '0';
	}
	for(int i = left; i <= mid; i++){
		v[i] = '1';
		add_element(v);
		v[i] = '0';
	}
	build(left, mid);
	build(mid+1, right);
}

void answer(int left, int right, vector< int > available){
	if(left == right){
		if(available.size() != 0) ans[available[0]] = left;
		return;
	}
	string v(n,'1');
	int mid = (left+right)/2;
	for(int a : available) v[a] = '0';
	vector< int > L;
	vector< int > R;
	for(int a : available){
		v[a] = '1';
		if(check_element(v)){
			L.push_back(a);
		}else{
			R.push_back(a);
		}
		v[a] = '0';
	}
	answer(left, mid, L);
	answer(mid+1, right, R);
}

std::vector<int> restore_permutation(int N, int w, int r) {
    n = N;
    build(0,n-1);
    compile_set();
    ans.resize(n);
    vector< int > v(n);
    for(int i = 0; i < n; i++){
		v[i]=i;
	}
    answer(0,n-1,v);
    //for(int a : ans) cout << a << ' ';
    //cout << endl;
    return ans;
}

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