제출 #414082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
414082		Blagojce	Swap (BOI16_swap)	C++11	0 / 100	121 ms	262148 KiB

swap

#include <bits/stdc++.h>
#include <cstdio>
#pragma GCC optimize("O3")
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
 
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
 
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 400000;

int n;
int a[mxn];

//unordered_map<int, vector<int> > f[mxn];


vector<int> f[mxn][40];

unordered_map<int,int> hsh[mxn];

vector<int> combine(int a, int x, int b, int y){
	x = hsh[a][x];
	y = hsh[b][y];
	
	
	int p = 0;
	int l = 1;
	
	vector<int> ret;
	while(p < (int)f[a][x].size()){
		fr(k, 0, l){
			ret.pb(f[a][x][p+k]);
		}
		fr(k, 0, l){
			ret.pb(f[b][y][p+k]);
		}
		p += l;
		l *= 2;
	}
	
	return ret;
}

void solve(){
	cin >> n;
	fr(i, 1, n+1){
		cin >> a[i];
	}
	int orgn = n;
	int m = n;
	while(m+1 - ((m+1)&-(m+1)) != 0){	
		++m;
	}
	
	fr(i, n+1, m+1){
		a[i] = i;
	}
	n = m;
	
	for(int i = n; i >= 1; i --){
		vector<int> cand;
		for(int j = i; j >= 1; j /= 2){
			cand.pb(a[j]);
			
			if(j != 1){
				if(j % 2){
					cand.pb(a[j-1]);
				}
				else{
					cand.pb(a[j+1]);
				}
			}
		}
		fr(j, 0, (int)cand.size()){
			hsh[i][cand[j]] = j;
		}
		for(auto j : cand){
			int id = hsh[i][j];
			if(i*2 > n){
				f[i][id] = {j};
			}
			else{
				int mi = min(j, min(a[i*2], a[i*2+1]));
				if(j == mi){
					f[i][id] = combine(i*2, a[i*2], i*2+1, a[i*2+1]);
				}
				else if(a[i*2] == mi){
					f[i][id] = combine(i*2, j, i*2+1, a[i*2+1]);
				}
				else{
					vector<int> g1 = combine(i*2, a[i*2], i*2+1, j);
					vector<int> g2 = combine(i*2, j, i*2+1, a[i*2]);
					f[i][id] = min(g1, g2);
				}
				f[i][id].insert(f[i][id].begin(), mi);	
			}
		}
	}
	fr(i, 0, orgn){
		cout<<f[1][hsh[1][a[1]]][i]<<' ';
	}	
}

int main(){
	//freopen("t.in.16", "r", stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	solve();
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 27
• Subtask 4: 0 / 20
• Subtask 5: 0 / 32