Submission #1093346

#	Time	Username	Problem	Language	Result	Execution time	Memory
1093346		asli_bg	Untitled (POI11_rot)	C++11	63 / 100	90 ms	27472 KiB

Main

#pragma GCC optimize("O3,unroll-loops")
 
#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
 
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> inset;
 
#define int long long
 
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define pb push_back
 
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define cont(x) {for(auto el:x) cout<<el<<' ';cout<<endl;}
#define contp(x) {for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;}
#define sp <<" "<<
#define mid (l+r)/2
#define endl '\n'
 
#define DEBUG(X) {cout<<#X<<' '<<(X)<<endl;}
 
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
 
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
 
const int MAXN=2e5+5;
const int INF=1e9+7;
const int MOD=1e9+7;
 
int n;
int t[MAXN];
int adj[MAXN][2];
int cur;
 
void oku(int nd){
    int el;
    cin>>el;
    if(el!=0){
        t[nd]=el;
        return;
    }

    t[nd]=-1;
    adj[nd][0]=++cur;
    oku(cur);

    adj[nd][1]=++cur;
    oku(cur);
}
 
int inv[MAXN];

void merge(inset& ata, inset& a, inset& b,int nd,int sol,int sag){
    if(a.size()<b.size()) a.swap(b);
    
    int bir=0;
    int iki=0;
    int sz=a.size();

    for(auto el:b){
        auto deg=a.order_of_key(el);
        bir+=deg;
        iki+=sz-deg;
    }

    for(auto el:b) a.insert(el);

    a.swap(ata);

    inv[nd]=inv[sol]+inv[sag]+min(bir,iki);
}

inset dfs(int nd,int ata){
    inset s;
    if(t[nd]>0) s.insert(t[nd]);

    if(adj[nd][0]>0 and adj[nd][1]>0){
        auto bir=dfs(adj[nd][0],ata);
        auto iki=dfs(adj[nd][1],ata);
        merge(s,bir,iki,nd,adj[nd][0],adj[nd][1]);
    }
    return s;
}
 
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    cin>>n;
    cur=1;

    oku(1);
    dfs(1,0);
 
    cout<<inv[1]<<endl;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10