| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 937782 | 1075508020060209tc | Swap (BOI16_swap) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
//#include<bits/extc++.h>
using namespace std;
int n;
int ar[200005];
map<int,vector<int>>dp[200005];
void chmn(vector<int>&nw,vector<int>&a,vector<int>&b){
for(int i=0;i<min(a.size(),b.size());i++){
if(a[i]<b[i]){
swap(nw,a);
return;
}
if(a[i]>b[i]){
swap(nw,b);
return;
}
}
if(a.size()<b.size()){
swap(nw,a);
return;
}
swap(nw,b);
}
void mrg(vector<int>&vc,vector<int>&a,vector<int>&b){
int ait=0;int bit=0;
for(int lg=0;(1<<lg)<=a.size()*2;lg++){
for(int k=0;k<(1<<lg)&&(ait+k)<a.size();k++){
vc.push_back(a[ait+k]);
}
ait+=(1<<lg);
for(int k=0;k<(1<<lg)&&(bit+k)<b.size();k++){
vc.push_back(b[bit+k]);
}
bit+=(1<<lg);
}
}
vector<pair<int,int>>seq;
bitset<200001>vis[200005];
void dfs(int nw,int nwv){
if(vis[nw][nwv]){return;}
vis[nw][nwv]=1;
if(nw*2>n){
//dp[nw][nwv]={nwv};
seq.push_back({nw,nwv});
return;
}
if(nw*2+1>n){
// chmn(dp[nw][nwv],{nwv,ar[nw*2]},{ar[nw*2],nwv});
seq.push_back({nw,nwv});
return;
}
if(nwv<ar[nw*2]&&nwv<ar[nw*2+1]){
dfs(nw*2,ar[nw*2]);
dfs(nw*2+1,ar[nw*2+1]);
seq.push_back({nw,nwv});
return;
}
if(ar[nw*2]<nwv&&ar[nw*2]<ar[nw*2+1]){
dfs(nw*2,nwv);
dfs(nw*2+1,ar[nw*2+1]);
seq.push_back({nw,nwv});
return;
}
dfs(nw*2,nwv);
dfs(nw*2+1,ar[nw*2]);
dfs(nw*2,ar[nw*2]);
dfs(nw*2+1,nwv);
seq.push_back({nw,nwv});
}
void solve(int nw,int nwv){
if(dp[nw][nwv].size()){return;}
if(nw*2>n){
dp[nw][nwv]={nwv};
return;
}
if(nw*2+1>n){
chmn(dp[nw][nwv],{nwv,ar[nw*2]},{ar[nw*2],nwv});
return;
}
if(nwv<ar[nw*2]&&nwv<ar[nw*2+1]){
dp[nw][nwv].push_back(nwv);
solve(nw*2,ar[nw*2]);
solve(nw*2+1,ar[nw*2+1]);
mrg(dp[nw][nwv],dp[nw*2][ar[nw*2]],dp[nw*2+1][ar[nw*2+1]]);
return;
}
if(ar[nw*2]<nwv&&ar[nw*2]<ar[nw*2+1]){
dp[nw][nwv].push_back(ar[nw*2]);
solve(nw*2,nwv);
solve(nw*2+1,ar[nw*2+1]);
mrg(dp[nw][nwv],dp[nw*2][nwv],dp[nw*2+1][ar[nw*2+1]]);
return;
}
vector<int>vc;
vc.push_back(ar[nw*2+1]);
solve(nw*2,nwv);
solve(nw*2+1,ar[nw*2]);
mrg(vc,dp[nw*2][nwv],dp[nw*2+1][ar[nw*2]]);
dp[nw][nwv].push_back(ar[nw*2+1]);
solve(nw*2,ar[nw*2]);
solve(nw*2+1,nwv);
mrg(dp[nw][nwv],dp[nw*2][ar[nw*2]],dp[nw*2+1][nwv]);
chmn(dp[nw][nwv],dp[nw][nwv],vc);
vector<int>().swap(vc);
}
signed main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>ar[i];
}
dfs(1,ar[1]);
int lit=0;
for(int i=0;i<seq.size();i++){
solve(seq[i].first,seq[i].second);
while(__lg(seq[lit].first)>__lg(seq[i].first)+1){
// vector<int>vc;
vector<int>().swap(dp[seq[lit].first][seq[lit].second]);
// swap(vc,dp[seq[lit].first][seq[lit].second]);
dp[seq[lit].first].erase(seq[lit].second);
lit++;
}
}
for(int i=0;i<dp[1][ar[1]].size();i++){
cout<<dp[1][ar[1]][i]<<" ";
}cout<<endl;
return 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(dp[i][j].size()){
cout<<i<<" "<<j<<":";
for(int v:dp[i][j]){
cout<<v<<" ";
}
cout<<endl;
}
}
}
}