Submission #1020434

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1020434	2024-07-12T04:27:47 Z	Tozzyyyy	Tree Rotations (POI11_rot)	C++14	100 / 100	232 ms	47240 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	23900 KB	Output is correct
2	Correct	11 ms	23900 KB	Output is correct
3	Correct	13 ms	23900 KB	Output is correct
4	Correct	13 ms	23904 KB	Output is correct
5	Correct	11 ms	23900 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	23900 KB	Output is correct
2	Correct	12 ms	23900 KB	Output is correct
3	Correct	11 ms	23900 KB	Output is correct
4	Correct	16 ms	23884 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	23900 KB	Output is correct
2	Correct	14 ms	23904 KB	Output is correct
3	Correct	15 ms	23976 KB	Output is correct
4	Correct	13 ms	24072 KB	Output is correct

Subtask #4
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	24320 KB	Output is correct
2	Correct	16 ms	24156 KB	Output is correct
3	Correct	14 ms	24412 KB	Output is correct
4	Correct	15 ms	24380 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	25472 KB	Output is correct
2	Correct	20 ms	24944 KB	Output is correct
3	Correct	35 ms	26460 KB	Output is correct
4	Correct	21 ms	25436 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	52 ms	28216 KB	Output is correct
2	Correct	34 ms	29188 KB	Output is correct
3	Correct	39 ms	30292 KB	Output is correct
4	Correct	42 ms	30548 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	35408 KB	Output is correct
2	Correct	47 ms	33724 KB	Output is correct
3	Correct	59 ms	32400 KB	Output is correct
4	Correct	54 ms	31544 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	73 ms	34132 KB	Output is correct
2	Correct	71 ms	35156 KB	Output is correct
3	Correct	64 ms	37604 KB	Output is correct
4	Correct	61 ms	37460 KB	Output is correct

Subtask #9
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	159 ms	41040 KB	Output is correct
2	Correct	117 ms	40156 KB	Output is correct
3	Correct	99 ms	40024 KB	Output is correct
4	Correct	130 ms	39508 KB	Output is correct
5	Correct	188 ms	38484 KB	Output is correct

Subtask #10
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	141 ms	40764 KB	Output is correct
2	Correct	114 ms	45444 KB	Output is correct
3	Correct	132 ms	44112 KB	Output is correct
4	Correct	96 ms	46264 KB	Output is correct
5	Correct	232 ms	40532 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	126 ms	41044 KB	Output is correct
2	Correct	103 ms	42576 KB	Output is correct
3	Correct	179 ms	41148 KB	Output is correct
4	Correct	159 ms	41296 KB	Output is correct
5	Correct	97 ms	47240 KB	Output is correct
6	Correct	217 ms	41044 KB	Output is correct

Submission #1020434

Compilation message