oj.uz

Submission #931035

# Submission time Handle Problem Language Result Execution time Memory
931035 2024-02-21T06:19:21 Z vjudge1 Tree Rotations (POI11_rot) C++17
63 / 100
 512 ms 65536 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 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=2e6+7;
const int inf=1e9;
int c[N], tin[N], tout[N], eul[N], sz[N], t[N*4], l[N], r[N], szz;
vector <pair<int*, int>> rb;
int n, timer, ans;
void roll(int &x){
	rb.push_back({&x, x});
}
void tupd(int pos, int v=1, int tl=1, int tr=n){
	roll(t[v]);
	if(tl == tr){
		t[v]++;
		return;
	}
	if(pos <= tm)tupd(pos, TL);
	else tupd(pos, 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 go(int v=1, int cl=0){
	if(c[v]){
		if(cl==0)tupd(c[v]);
		return;
	}
	int temp = rb.size();
	int big, small;
	if(sz[l[v]] < sz[r[v]]){
		big = r[v];
		small = l[v]; 
	}
	else{
		big = l[v];
		small = r[v];
	}
	go(small, 1);
	go(big, 0);
	int cntkeep=0, cntswap=0;
	for(int i=tin[small]; i <= tout[small]; i++){	
		if(big == r[v]){	
			cntkeep += get(eul[i], n);
			cntswap += get(1, eul[i]);
		}
		else {
			cntkeep += get(1, eul[i]);
			cntswap += get(eul[i], n);
		}
	}
	ans += min(cntkeep, cntswap);
	if(cl==0) {
		for(int i=tin[small]; i <= tout[small]; i++){
			tupd(eul[i]);
		}
	}
	else{
		while(temp < rb.size()){
			*(rb.back().F) = rb.back().S;
			rb.pop_back();
		}
	}
	
}
void rec(){
	cin >> c[szz];
	if(c[szz]){
		tin[szz] = tout[szz] = ++timer;
		eul[timer] = c[szz];
		sz[szz] = 1;
	}
	else{
		int cur = szz;
		
		szz++;
		l[cur] = szz;
		rec();
		
		szz++;
		r[cur] = szz;
		rec();
		
		tin[cur] = tin[l[cur]];
		tout[cur] = timer;
		
		sz[cur] = sz[l[cur]] + sz[r[cur]];
	}
}
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;
}

Compilation message

rot.cpp: In function 'void go(int, int)':
rot.cpp:75:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int*, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   while(temp < rb.size()){
      |         ~~~~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 3 ms 13148 KB Output is correct
3 Correct 3 ms 13148 KB Output is correct
4 Correct 2 ms 13144 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14296 KB Output is correct
2 Correct 8 ms 14044 KB Output is correct
3 Correct 5 ms 14296 KB Output is correct
4 Correct 5 ms 14296 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 20176 KB Output is correct
2 Correct 28 ms 18388 KB Output is correct
3 Correct 87 ms 23632 KB Output is correct
4 Correct 19 ms 18384 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 32084 KB Output is correct
2 Correct 76 ms 34880 KB Output is correct
3 Correct 88 ms 39356 KB Output is correct
4 Correct 84 ms 38328 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 60548 KB Output is correct
2 Correct 112 ms 58284 KB Output is correct
3 Correct 156 ms 56596 KB Output is correct
4 Correct 114 ms 54968 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 178 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 512 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 261 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 323 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -