제출 #296160

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

messy

#include "messy.h"
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

vi restore_permutation(int n,int w,int r){
	int N=0;
	for(int i=0;i<30;i++) if((1<<i)==n) {
		N=i;
		break;
	}
	vi perm(n);
	for(int i=N-1;i>=0;i--) for(int j=0;j<n;j++) if(j&1<<i){
		string s(n,'0');
		for(int k=0;k<n;k++) if((j>>(i+1))!=(k>>(i+1))) s[k]='1';
		s[j]='1';
		add_element(s);
	}
	compile_set();
	for(int i=N-1;i>=0;i--){
		for(int j=0;j<n;j++){
			string s(n,'0');
			for(int k=0;k<n;k++) if((perm[j]>>(i+1))!=(perm[k]>>(i+1))) s[k]='1';
			s[j]='1';
			if(check_element(s)) perm[j]|=1<<i;
		}
	}
	return perm;
}

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