Submission #1067013

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067013		vux2code	Untitled (POI11_rot)	C++14	63 / 100	125 ms	50260 KiB

Main

//Src : Vux2Code
#include <bits/stdc++.h>
using namespace std;

typedef int ll ;

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

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

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

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

ll merge(ll r1, ll r2) {
    if (!r1 || !r2) return r1 + r2;
    s1 += (ll)sum[rs[r1]] * sum[ls[r2]];
    s2 += (ll)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(ll 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);
    }
}

int main() {
    ios::sync_with_stdio (0);
    cin. tie (0);
    cout. tie (0);

    cin >> n;
    cnt = 1;
    init(1);
    for (ll i = 1; i <= cnt; ++i)
        if (val[i]) build(1, n, root[i], val[i]);
    solve(1);
    cout << ans;
    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: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10