oj.uz

Submission #1020634

# Submission time Handle Problem Language Result Execution time Memory
1020634 2024-07-12T07:55:04 Z quannnguyen2009 Tree Rotations (POI11_rot) C++14
72 / 100
 107 ms 65536 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];
int 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+=(int)sum[rs[r1]]*sum[ls[r2]];
    s2+=(int)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 Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 472 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 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 3 ms 1884 KB Output is correct
2 Correct 2 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 6 ms 5208 KB Output is correct
2 Correct 10 ms 5468 KB Output is correct
3 Correct 23 ms 13788 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 34 ms 23980 KB Output is correct
2 Correct 27 ms 22872 KB Output is correct
3 Correct 44 ms 25876 KB Output is correct
4 Correct 32 ms 27740 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 41052 KB Output is correct
2 Correct 62 ms 41812 KB Output is correct
3 Correct 63 ms 40528 KB Output is correct
4 Correct 52 ms 42320 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 59336 KB Output is correct
2 Correct 95 ms 58448 KB Output is correct
3 Correct 79 ms 60240 KB Output is correct
4 Correct 78 ms 59984 KB Output is correct

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 65 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 69 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 67 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -