제출 #1020634

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1020634		quannnguyen2009	무제 (POI11_rot)	C++14	72 / 100	107 ms	65536 KiB

Main

#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
using namespace std;

const int N=400005;
int sum[4000005],ls[4000005],rs[4000005];
int root[N],l[N],r[N],val[N];
int ans,s1,s2;
int cnt,n,seg;

void init(int ro) {
    cin >> val[ro];
    if (!val[ro]){
        l[ro]=++cnt;
        init(l[ro]);
        r[ro]=++cnt;
        init(r[ro]);
    }
}

void pushup(int rt) {
    sum[rt]=sum[ls[rt]]+sum[rs[rt]];
}

void build(int l,int r,int &rt,int key) {
    if (!rt)rt=++seg;
    if (l==r){sum[rt]++;return;}
    int mid=(l+r)>>1;
    if (key<=mid)build(l,mid,ls[rt],key);
    else build(mid+1,r,rs[rt],key);
    pushup(rt);
}

int merge(int r1,int r2) {
    if (!r1 || !r2)return r1+r2;
    s1+=(int)sum[rs[r1]]*sum[ls[r2]];
    s2+=(int)sum[ls[r1]]*sum[rs[r2]];
    ls[r1]=merge(ls[r1],ls[r2]);
    rs[r1]=merge(rs[r1],rs[r2]);
    pushup(r1);
    return r1;
}

void solve(int ro) {
    if (!ro)return;
    solve(l[ro]);solve(r[ro]);
    if (!val[ro]){
        s1=s2=0;
        root[ro]=merge(root[l[ro]],root[r[ro]]);
        ans+=min(s1,s2);
    }
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n; cnt=1;
    init(1);
    for (int i=1;i<=cnt;++i) {
        if (val[i]) build(1,n,root[i],val[i]);
    }
    solve(1);
    cout << ans;
}

• 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: 9 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10