oj.uz

답안 #1093319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093319 2024-09-26T14:39:46 Z asli_bg Tree Rotations (POI11_rot) C++11
0 / 100
 32 ms 37456 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=2e5+5;
const int INF=1e9+7;
const int MOD=1e9+7;

int n;
//int adj[MAXN][2];
int t[MAXN*4];
bool leaf[MAXN];

void oku(int nd){
    int el;
    cin>>el;
    if(el!=0){
        t[nd]=el;
        leaf[nd]=true;
        return;
    }
    t[nd]=-1;
    oku(nd*2);
    oku(nd*2+1);
}

int inv[4*MAXN];
inset s[MAXN];

void merge(int nd,int sol,int sag){
    if(s[sol].size() < s[sag].size()){
        swap(sag,sol);
        s[nd]=s[sol];
        inv[nd]+=inv[sol];

        if(t[nd]!=-1) s[sag].insert(t[nd]);
      
        for(auto el:s[sag]){
            inv[nd]+=s[nd].order_of_key(el);
            s[nd].insert(el);
        }
    }
    else{
        s[nd]=s[sol];
        inv[nd]+=inv[sol];

        if(t[nd]!=-1) s[sag].insert(t[nd]);

        for(auto el:s[sag]){
            inv[nd]+=s[nd].size()-s[nd].order_of_key(el);
            s[nd].insert(el);
        }
    }
}

void dfs(int nd,int ata){ 
    if(t[nd]==0) return;
    if(leaf[nd*2] and leaf[nd*2+1]){
        if(t[nd*2]>t[nd*2+1]) swap(t[nd*2],t[nd*2+1]);
    }
    dfs(nd*2,ata);
    dfs(nd*2+1,ata);
    merge(nd,nd*2,nd*2+1);
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin>>n;

    oku(1);
    dfs(1,0);

    cout<<inv[1]<<endl;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 15964 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 16220 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 22 ms 32596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 20 ms 32348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 32344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 32344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 28 ms 32356 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 20 ms 32344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 32 ms 37456 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 32284 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 32348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -