oj.uz

Submission #1020430

# Submission time Handle Problem Language Result Execution time Memory
1020430 2024-07-12T04:26:47 Z Tozzyyyy Tree Rotations (POI11_rot) C++17
0 / 100
 158 ms 42984 KB 
//#pragma GCC optimize("O3","unroll-loops")
#include<bits/stdc++.h>
#define all(x) (x).begin() , (x).end()
#define pll pair<long long, long long>
#define pii pair<int , int>
#define fi first
#define se second
#define bit(i,j) ((j >> i) & 1)
using namespace std;

const long long inf = 1e18+1;
const int mod = 1e9+7;
const int MAXN = 1e6+100;

#define int long long

int bit[MAXN] , n;
void upd(int x , int val){
	while(x <= n){
		bit[x] += val;
		x += (x & (-x));
	}
}
int get(int x){
	int res = 0;
	while(x > 0){
		res += bit[x];
		x -= (x & (-x));
	}
	return res;
}

vector<int> adj[MAXN];
int id = 1 , c[MAXN] , sz[MAXN];
void Input(){
	int x; cin >> x;
	c[id] = x;
	if(x!=0) return;
	int t = id;
	adj[t].push_back(id+1);
	id++ ; Input();
	adj[t].push_back(id+1);
	id++ ; Input();
}

void dfs_sz(int u){
	sz[u] = 1;
	for(auto v : adj[u]) dfs_sz(v) , sz[u] += sz[v];
}
void modify(int u , int val){
	if(adj[u].size() == 0){
		upd(c[u] , val); return;
	}
	for(auto v : adj[u]) modify(v , val);
}
int cnt1 = 0 , cnt2 = 0;
void cal(int u){
	if(adj[u].size() == 0){
		cnt1 += get(c[u] - 1);
		cnt2 += get(n) - get(c[u]);
		return;
	}
	for(auto v : adj[u]) cal(v);
}
int ans[MAXN];
void dfs(int u){
	if(adj[u].size() == 0){
		upd(c[u] , 1); return;
	}
	int bc = (sz[adj[u][0]] > sz[adj[u][1]] ? 0 : 1);
	int sc = bc ^ 1;
	bc = adj[u][bc]; sc = adj[u][sc];
	dfs(sc);
	modify(sc , -1);
	dfs(bc);
	cnt1 = cnt2 = 0;
	cal(sc);
	modify(sc , 1);
	ans[u] = ans[bc] + min(cnt1 , cnt2);
}
int32_t main(){
  	//freopen("TRAVEL.INP", "r", stdin);
	//freopen("Nowruz.out", "w", stdout);
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin >> n;
	Input();
	dfs_sz(1);
	dfs(1);
	cout << ans[1] << "\n";

	return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 9.0

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

Subtask #10
0 / 9.0

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

Subtask #11
0 / 10.0

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