oj.uz

답안 #1020447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1020447 2024-07-12T04:40:47 Z vjudge1 Tree Rotations (POI11_rot) C++17
100 / 100
 206 ms 48928 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] + ans[sc] + 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
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23900 KB Output is correct
2 Correct 10 ms 23820 KB Output is correct
3 Correct 11 ms 23900 KB Output is correct
4 Correct 10 ms 23844 KB Output is correct
5 Correct 11 ms 23900 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23908 KB Output is correct
2 Correct 11 ms 23896 KB Output is correct
3 Correct 11 ms 23900 KB Output is correct
4 Correct 11 ms 23952 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23900 KB Output is correct
2 Correct 16 ms 23900 KB Output is correct
3 Correct 11 ms 23900 KB Output is correct
4 Correct 13 ms 23900 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 24412 KB Output is correct
2 Correct 13 ms 24152 KB Output is correct
3 Correct 12 ms 24412 KB Output is correct
4 Correct 12 ms 24508 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 25436 KB Output is correct
2 Correct 17 ms 25044 KB Output is correct
3 Correct 32 ms 26716 KB Output is correct
4 Correct 22 ms 25508 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 28268 KB Output is correct
2 Correct 32 ms 29528 KB Output is correct
3 Correct 36 ms 30796 KB Output is correct
4 Correct 36 ms 31060 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 35408 KB Output is correct
2 Correct 44 ms 34336 KB Output is correct
3 Correct 57 ms 33020 KB Output is correct
4 Correct 45 ms 32340 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 34132 KB Output is correct
2 Correct 57 ms 36124 KB Output is correct
3 Correct 57 ms 38480 KB Output is correct
4 Correct 63 ms 38388 KB Output is correct

Subtask #9
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 42576 KB Output is correct
2 Correct 105 ms 41556 KB Output is correct
3 Correct 91 ms 41416 KB Output is correct
4 Correct 108 ms 40948 KB Output is correct
5 Correct 167 ms 39760 KB Output is correct

Subtask #10
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 42348 KB Output is correct
2 Correct 102 ms 47184 KB Output is correct
3 Correct 118 ms 45632 KB Output is correct
4 Correct 87 ms 47928 KB Output is correct
5 Correct 206 ms 42064 KB Output is correct

Subtask #11
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 42832 KB Output is correct
2 Correct 102 ms 44400 KB Output is correct
3 Correct 161 ms 42832 KB Output is correct
4 Correct 123 ms 43092 KB Output is correct
5 Correct 113 ms 48928 KB Output is correct
6 Correct 203 ms 42580 KB Output is correct