Submission #1067019

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1067019	2024-08-20T09:42:18 Z	vux2code	Tree Rotations (POI11_rot)	C++17	72 / 100	98 ms	65536 KB

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

typedef long long 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.0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	604 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	1 ms	604 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct

Subtask #4
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1884 KB	Output is correct
2	Correct	3 ms	1884 KB	Output is correct
3	Correct	2 ms	2140 KB	Output is correct
4	Correct	2 ms	2140 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	5208 KB	Output is correct
2	Correct	8 ms	5468 KB	Output is correct
3	Correct	21 ms	13660 KB	Output is correct
4	Correct	7 ms	5980 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	23900 KB	Output is correct
2	Correct	25 ms	22872 KB	Output is correct
3	Correct	37 ms	25776 KB	Output is correct
4	Correct	37 ms	27732 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	64 ms	41048 KB	Output is correct
2	Correct	49 ms	41816 KB	Output is correct
3	Correct	63 ms	40528 KB	Output is correct
4	Correct	52 ms	42324 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	98 ms	59508 KB	Output is correct
2	Correct	93 ms	58448 KB	Output is correct
3	Correct	79 ms	60244 KB	Output is correct
4	Correct	75 ms	60036 KB	Output is correct

Subtask #9
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	60 ms	65536 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	59 ms	65536 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #11
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	61 ms	65536 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Submission #1067019

Compilation message