oj.uz

Submission #1021935

# Submission time Handle Problem Language Result Execution time Memory
1021935 2024-07-13T07:54:33 Z BuiDucManh123 Tree Rotations (POI11_rot) C++14
0 / 100
 158 ms 29012 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=4e5;
vector <int> g[N+5];
int n,x,i=0,value[N+5],siz[N+5],ans[N+5],bit[N+5],a,b,l,r;
void input(){
    cin>>x;
    if(x){
        value[i]=x;
        return;
    }
    int k=i;
    i++;
    g[k].push_back(i);
    input();
    i++;
    g[k].push_back(i);
    input();
}
void update(int i, int val){
    while(i<=N){
        bit[i]+=val;
        i+=i&-i;
    }
}
int get(int i){
    int val=0;
    while(i>0){
        val+=bit[i];
        i-=i&-i;
    }
    return val;
}
void add(int i, int val){
    if (value[i]){
        update(value[i],val);
        return;
    }
    add(g[i][0],val);
    add(g[i][1],val);
}
void tinh(int i){
    if (value[i]){
        l+=get(value[i]);
        r+=get(n)-get(value[i]);
        return;
    }
    for (int x : g[i]) tinh(x);
}
void solve(int i){
    if (value[i]){
        siz[i]=1;
        update(value[i],1);
        return;
    }
    int x=g[i][0];
    int y=g[i][1];
    solve(x); ans[i]+=ans[x];
    solve(y); ans[i]+=ans[y];
    if (siz[x]>siz[y]) swap(x,y);
    add(x,-1);
    l=0;r=0;
    tinh(x);
    add(x,1);
    ans[i]+=min(l,r);
    siz[i]=siz[x]+siz[y];
}
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
    input();
    solve(0);
    cout<<ans[0];
    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 9820 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 9820 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 9820 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 10332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 11356 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 14420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 20816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 21076 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 158 ms 27732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 96 ms 27984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 118 ms 29012 KB Output isn't correct
2 Halted 0 ms 0 KB -