제출 #752814

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

messy

#include<bits/stdc++.h>
#include "messy.h"
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define lastbit(i) __builtin_ctz(i)
using namespace std;
int n;
void add(int l,int r){
if (l>=r)return;
string temp;
for1(i,0,n-1){
temp.pb('1');
}
for1(j,l,r){
temp[j]='0';
}
int mid=(l+(r-l+1)/2-1);
for1(j,l,mid){
temp[j]='1';
add_element(temp);
temp[j]='0';
}
add(l,mid);
add(mid+1,r);
}
int per[128];
int turn[128];
void solve(int l,int r,vector<int>can){
if (l==r){
    per[can[0]]=l;
    return;
}
memset(turn,0,sizeof(turn));
for(auto v:can){
    turn[v]=1;
}
string temp;
for1(i,0,n-1){
if (turn[i])temp.pb('0');
else temp.pb('1');
}
vector<int>cl,cr;
for(auto v:can){
temp[v]='1';
bool fl=check_element(temp);
temp[v]='0';
if (fl){
    cl.pb(v);
}
else {
    cr.pb(v);
}
}
int mid=(l+(r-l+1)/2-1);
solve(l,mid,cl);
solve(mid+1,r,cr);
}
vector<int>restore_permutation(int N,int w,int r){
n=N;
add(0,n-1);
compile_set();
vector<int>can;
for1(i,0,n-1){
can.pb(i);
}
solve(0,n-1,can);
vector<int>ans;
for1(i,0,n-1){
ans.pb(per[i]);
}
return ans;
}

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