Submission #1093350

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1093350	2024-09-26T17:00:22 Z	asli_bg	Tree Rotations (POI11_rot)	C++11	100 / 100	359 ms	45532 KB

#pragma GCC optimize("O3,unroll-loops")
 
#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
 
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> inset;
 
#define int long long
 
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define pb push_back
 
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define cont(x) {for(auto el:x) cout<<el<<' ';cout<<endl;}
#define contp(x) {for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;}
#define sp <<" "<<
#define mid (l+r)/2
#define endl '\n'
 
#define DEBUG(X) {cout<<#X<<' '<<(X)<<endl;}
 
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
 
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
 
const int MAXN=5e5+5;
const int INF=1e9+7;
const int MOD=1e9+7;
 
int n;
int t[MAXN];
int adj[MAXN][2];
int cur;
bool leaf[MAXN];
 
void oku(int nd){
    int el;
    cin>>el;
    if(el!=0){
        t[nd]=el;
        leaf[nd]=true;
        return;
    }

    t[nd]=-1;
    adj[nd][0]=++cur;
    oku(cur);

    adj[nd][1]=++cur;
    oku(cur);
}
 
int inv[MAXN];

void merge(inset& ata, inset& a, inset& b,int nd,int sol,int sag){
    if(a.size()<b.size()) a.swap(b);
    
    int bir=0;
    int iki=0;
    int sz=a.size();

    for(auto el:b){
        auto deg=a.order_of_key(el);
        bir+=deg;
        iki+=sz-deg;
    }

    for(auto el:b) a.insert(el);

    a.swap(ata);

    inv[nd]=inv[sol]+inv[sag]+min(bir,iki);
}

inset dfs(int nd,int ata){
    inset s;
    if(leaf[nd]){
        //DEBUG(nd);
        s.insert(t[nd]);    
        return s;
    }

    auto bir=dfs(adj[nd][0],ata);
    auto iki=dfs(adj[nd][1],ata);
    merge(s,bir,iki,nd,adj[nd][0],adj[nd][1]);

    return s;
}
 
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    cin>>n;
    cur=1;

    oku(1);
    dfs(1,0);
 
    cout<<inv[1]<<endl;
}

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	352 KB	Output is correct
4	Correct	352 KB	Output is correct
5	Correct	352 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	352 KB	Output is correct
2	Correct	352 KB	Output is correct
3	Correct	352 KB	Output is correct
4	Correct	352 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	608 KB	Output is correct
3	Correct	1 ms	608 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	1632 KB	Output is correct
2	Correct	4 ms	864 KB	Output is correct
3	Correct	2 ms	1628 KB	Output is correct
4	Correct	2 ms	1632 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	4152 KB	Output is correct
2	Correct	13 ms	1896 KB	Output is correct
3	Correct	48 ms	4688 KB	Output is correct
4	Correct	10 ms	3688 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	76 ms	7264 KB	Output is correct
2	Correct	41 ms	10336 KB	Output is correct
3	Correct	48 ms	13548 KB	Output is correct
4	Correct	44 ms	13664 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	59 ms	27596 KB	Output is correct
2	Correct	62 ms	19940 KB	Output is correct
3	Correct	83 ms	14164 KB	Output is correct
4	Correct	62 ms	11600 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	103 ms	14676 KB	Output is correct
2	Correct	96 ms	18228 KB	Output is correct
3	Correct	87 ms	27728 KB	Output is correct
4	Correct	90 ms	27476 KB	Output is correct

Subtask #9
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	217 ms	30548 KB	Output is correct
2	Correct	155 ms	25168 KB	Output is correct
3	Correct	161 ms	26964 KB	Output is correct
4	Correct	173 ms	24656 KB	Output is correct
5	Correct	294 ms	24148 KB	Output is correct

Subtask #10
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	164 ms	25684 KB	Output is correct
2	Correct	178 ms	43092 KB	Output is correct
3	Correct	202 ms	34648 KB	Output is correct
4	Correct	165 ms	45132 KB	Output is correct
5	Correct	359 ms	28120 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	211 ms	29268 KB	Output is correct
2	Correct	174 ms	29012 KB	Output is correct
3	Correct	259 ms	25688 KB	Output is correct
4	Correct	221 ms	29800 KB	Output is correct
5	Correct	153 ms	45532 KB	Output is correct
6	Correct	280 ms	29016 KB	Output is correct

Submission #1093350

Compilation message