Submission #931062

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
931062	2024-02-21T07:26:48 Z	vjudge1	Tree Rotations (POI11_rot)	C++17	100 / 100	681 ms	29372 KB

//gm  --- akezhon
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define int long long
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NET r < tl || tr < l
#define double long double
using namespace std;
const int N=6e5+7;
const int inf=1e9;
int c[N], sz[N], t[N*4], l[N], r[N], szz, a, b;
int n, timer, ans;
void tupd(int pos, int val, int v=1, int tl=1, int tr=n){
	if(tl == tr){
		t[v] = val;
		return;
	}
	if(pos <= tm)tupd(pos, val, TL);
	else tupd(pos, val, TR);
	t[v] = t[v+v] + t[v+v+1];
}
int get(int l, int r, int v=1, int tl=1, int tr=n){
	if(NET)return 0;
	if(DA)return t[v];
	return get(l, r, TL) + get(l, r, TR);
}
void calc(int v){
	if(c[v]){
		a += get(1, c[v]-1);
		b += get(c[v]+1, n);
	}else{
		calc(l[v]);
		calc(r[v]);
	}
}
void add(int v, int x){
	if(c[v]){
		tupd(c[v], x);
	}else{
		add(l[v], x);
		add(r[v], x);
	}
}
void go(int v=1, int cl=0){
	if(c[v]){
		if(cl==0)tupd(c[v], 1);
		return;
	}
	if(sz[l[v]] > sz[r[v]]){
		swap(l[v], r[v]);
	}
	go(l[v], 1);
	go(r[v], 0);
	
	a=0, b=0;
	calc(l[v]);
	ans += min(a, b);
	
	if(cl)add(r[v], 0);
	else add(l[v], 1);
}
void rec(){
	cin >> c[szz];
	if(c[szz]){
		sz[szz] = 1;
	}
	else{
		int v = szz;
		
		l[v] = ++szz;
		rec();
		r[v] = ++szz;
		rec();
		
		sz[v] = sz[l[v]]+sz[r[v]];
	}
}
void AlemAmenov(){
	
	cin >> n;
	szz=1;
	rec();
	go();
	cout << ans;

}
signed main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	// freopen("promote.in", "r", stdin);
	// freopen("promote.out", "w", stdout);
	int RealName=1;
	// cin >> RealName;
	// int C=0;
	while(RealName--){
		// cout << "Case " << ++C << ":\n";
		AlemAmenov();
	}

return 0;
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	8540 KB	Output is correct
2	Correct	1 ms	8540 KB	Output is correct
3	Correct	2 ms	8540 KB	Output is correct
4	Correct	1 ms	8540 KB	Output is correct
5	Correct	2 ms	8540 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	8540 KB	Output is correct
2	Correct	1 ms	8540 KB	Output is correct
3	Correct	1 ms	8536 KB	Output is correct
4	Correct	1 ms	8536 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	8536 KB	Output is correct
2	Correct	2 ms	8540 KB	Output is correct
3	Correct	2 ms	8540 KB	Output is correct
4	Correct	2 ms	8664 KB	Output is correct

Subtask #4
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	8796 KB	Output is correct
2	Correct	6 ms	8736 KB	Output is correct
3	Correct	3 ms	8792 KB	Output is correct
4	Correct	3 ms	8796 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	11356 KB	Output is correct
2	Correct	22 ms	12952 KB	Output is correct
3	Correct	68 ms	12892 KB	Output is correct
4	Correct	14 ms	13176 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	125 ms	14976 KB	Output is correct
2	Correct	52 ms	15708 KB	Output is correct
3	Correct	64 ms	16304 KB	Output is correct
4	Correct	58 ms	16208 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	44 ms	19548 KB	Output is correct
2	Correct	78 ms	18004 KB	Output is correct
3	Correct	121 ms	17960 KB	Output is correct
4	Correct	71 ms	17312 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	127 ms	19196 KB	Output is correct
2	Correct	114 ms	19992 KB	Output is correct
3	Correct	98 ms	21844 KB	Output is correct
4	Correct	93 ms	21596 KB	Output is correct

Subtask #9
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	421 ms	25940 KB	Output is correct
2	Correct	220 ms	26152 KB	Output is correct
3	Correct	221 ms	25432 KB	Output is correct
4	Correct	256 ms	24960 KB	Output is correct
5	Correct	511 ms	24200 KB	Output is correct

Subtask #10
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	226 ms	25212 KB	Output is correct
2	Correct	219 ms	29372 KB	Output is correct
3	Correct	262 ms	27984 KB	Output is correct
4	Correct	173 ms	29176 KB	Output is correct
5	Correct	636 ms	25176 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	249 ms	24668 KB	Output is correct
2	Correct	206 ms	25168 KB	Output is correct
3	Correct	473 ms	24484 KB	Output is correct
4	Correct	296 ms	24656 KB	Output is correct
5	Correct	165 ms	29120 KB	Output is correct
6	Correct	681 ms	24200 KB	Output is correct

Submission #931062

Compilation message