oj.uz

Submission #1021987

# Submission time Handle Problem Language Result Execution time Memory
1021987 2024-07-13T08:31:24 Z BuiDucManh123 Tree Rotations (POI11_rot) C++17
0 / 100
 180 ms 26964 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=4e5;
vector <int> g[N+9];
int n,value[N+9],bit[N+9],ans[N+9],x,i=0,l,r,siz[N+9];
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 cnt(int i){
    if(value[i]){
        siz[i]=1;
        return;
    }for(auto x:g[i]){
        cnt(x);
        siz[i]+=siz[x];
    }
}
void update(int i, int val){
    while(i<=N){
        bit[i]+=val;
        i+=i&-i;
    }
}
int get(int i){
    int val=0;
    while(i){
        val+=bit[i];
        i-=i&-i;
    }
    return val;
}
void add(int i, int val){
    if (value[i]){
        update(value[i],val);
        return;
    }
    for(auto x:g[i]){
        add(x,val);
    }
}
void tinh(int i){
    if (value[i]){
        l+=get(value[i]);
        return;
    }
    for (auto x : g[i]) tinh(x);
}
void solve(int i){
    if (value[i]){
        update(value[i],1);
        return;
    }
    for(auto x:g[i]){
        solve(x);
        ans[i]+=ans[x];
    }int x=g[i][0];
    int y=g[i][1];
    if (siz[x]>siz[y]) swap(x,y);
    add(x,-1);
    l=0;
    tinh(x);
    add(x,1);
  	r=siz[x];r*=siz[y];
    ans[i]+=min(l,r-l);
}
int32_t main(){
    cin>>n;
    input();
    cnt(0);
    solve(0);
    cout<<ans[0];
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 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 9816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 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 12 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 50 ms 14164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

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

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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

Subtask #11
0 / 10.0

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