Submission #1022467

#	Time	Username	Problem	Language	Result	Execution time	Memory
1022467		BuiDucManh123	Untitled (POI11_rot)	C++14	100 / 100	320 ms	43856 KiB

Main

#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define int long long
using namespace std;
const int N=8e5+5;
int bit[N],sz[N],value[N],id=0,n,ans[N],l,r;
vector<int>g[N];
void input(){
    int x;
    cin>>x;
    value[id]=x;
    if (x) return;
    int k=id;
    g[k].push_back(++id);
    input();
    g[k].push_back(++id);
    input();
}
int getSum(int p) {
    int idx = p, res = 0;
    while (idx > 0) {
        res += bit[idx];
        idx -= (idx & (-idx));
    }
    return res;
}
void update(int u, int v) {
    int idx = u;
    while (idx <= N) {
        bit[idx] += v;
        idx += (idx & (-idx));
    }
}
void cnt(int id){
    if(value[id]){
        sz[id]=1;
        return;
    }for(int x:g[id]){
        cnt(x);
        sz[id]+=sz[x];
    }return;
}
void add(int id, int val){
    if(value[id]){
        update(value[id],val);
        return;
    }for(int x:g[id]) add(x,val);
}
void cal(int id){
    if(value[id]){
        l+=getSum(value[id]);
        r+=getSum(n)-getSum(value[id]);
        return;
    }for(int x:g[id]) cal(x);
}
void solve(int id){
    if(value[id]){
        update(value[id],1);
        return;
    }int x=g[id][0];
    int y=g[id][1];
    if(sz[x]>sz[y]) swap(x,y);
    solve(x);
    ans[id]+=ans[x];
    add(x,-1);
    solve(y);
    ans[id]+=ans[y];
    l=0;r=0;
    cal(x);
    add(x,1);
    ans[id]+=min(l,r);
    return;
}
signed main() {
    cin>>n;
    input();
    cnt(0);
    solve(0);
    cout<<ans[0];
	return 0;
}

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