Submission #1021985

#	Time	Username	Problem	Language	Result	Execution time	Memory
1021985		BuiDucManh123	Untitled (POI11_rot)	C++14	0 / 100	137 ms	44820 KiB

Main

#include <bits/stdc++.h>
using namespace std;
const int N=4e5;
vector <int> g[N+9],v[N+9];
int n,value[N+9],bit[N+9],ans[N+9],x,i=0,l,r,siz[N+9];
void input(){
    cin>>x;
    if(x){
        value[i]=x;
        return;
    }
    int k=i;
    i++;
    g[k].push_back(i);
    input();
    i++;
    g[k].push_back(i);
    input();
}
void cnt(int i){
    if(value[i]){
        siz[i]=1;
        return;
    }for(auto x:g[i]){
        cnt(x);
        siz[i]+=siz[x];
    }
}
void update(int i, int val){
    while(i<=N){
        bit[i]+=val;
        i+=i&-i;
    }
}
int get(int i){
    int val=0;
    while(i){
        val+=bit[i];
        i-=i&-i;
    }
    return val;
}
void add(int i, int val){
    if (value[i]){
        update(value[i],val);
        return;
    }
    for(auto x:g[i]){
        add(x,val);
    }
}
void tinh(int i){
    if (value[i]){
        l+=get(value[i]);
        r+=get(n)-get(value[i]);
        return;
    }
    for (auto x : g[i]) tinh(x);
}
void solve(int i){
    if (value[i]){
        v[i].push_back(value[i]);
        update(value[i],1);
        return;
    }
    for(auto x:g[i]){
        solve(x);
        ans[i]+=ans[x];
    }int x=g[i][0];
    int y=g[i][1];
    if (siz[x]>siz[y]) swap(x,y);
    l=0;
    for(auto j:v[x]){
        update(j,-1);
    }
    for(auto j:v[x])
        l+=get(j);
    r=v[x].size();
    r*=v[y].size();
    swap(v[i],v[y]);
    for(auto j:v[x]) v[i].push_back(j);
    ans[i]+=min(l,r-l);
}
int32_t main(){
    cin>>n;
    input();
    cnt(0);
    solve(0);
    cout<<ans[0];
    return 0;
}

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