Submission #1020640

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1020640	2024-07-12T07:57:33 Z	vjudge1	Tree Rotations (POI11_rot)	C++17	100 / 100	144 ms	53588 KB

#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];
long long 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+=(long long)sum[rs[r1]]*sum[ls[r2]];
    s2+=(long long)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.0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	344 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	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

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	0 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	1116 KB	Output is correct
2	Correct	2 ms	1116 KB	Output is correct
3	Correct	2 ms	1368 KB	Output is correct
4	Correct	2 ms	1372 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	2908 KB	Output is correct
2	Correct	6 ms	2908 KB	Output is correct
3	Correct	17 ms	7004 KB	Output is correct
4	Correct	6 ms	3160 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	12056 KB	Output is correct
2	Correct	25 ms	11956 KB	Output is correct
3	Correct	29 ms	13404 KB	Output is correct
4	Correct	27 ms	14428 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	54 ms	21596 KB	Output is correct
2	Correct	41 ms	21332 KB	Output is correct
3	Correct	51 ms	20564 KB	Output is correct
4	Correct	48 ms	21076 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	79 ms	29592 KB	Output is correct
2	Correct	75 ms	29260 KB	Output is correct
3	Correct	62 ms	30800 KB	Output is correct
4	Correct	66 ms	30548 KB	Output is correct

Subtask #9
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	93 ms	44112 KB	Output is correct
2	Correct	79 ms	44116 KB	Output is correct
3	Correct	113 ms	43088 KB	Output is correct
4	Correct	91 ms	43688 KB	Output is correct
5	Correct	111 ms	42580 KB	Output is correct

Subtask #10
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	119 ms	48112 KB	Output is correct
2	Correct	105 ms	50772 KB	Output is correct
3	Correct	131 ms	49748 KB	Output is correct
4	Correct	116 ms	51024 KB	Output is correct
5	Correct	125 ms	48884 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	130 ms	50256 KB	Output is correct
2	Correct	144 ms	51284 KB	Output is correct
3	Correct	128 ms	50556 KB	Output is correct
4	Correct	135 ms	50512 KB	Output is correct
5	Correct	139 ms	53588 KB	Output is correct
6	Correct	114 ms	50512 KB	Output is correct

Submission #1020640

Compilation message