oj.uz

답안 #867094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867094 2023-10-27T16:49:20 Z vjudge1 Tree Rotations (POI11_rot) C++17
63 / 100
 527 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 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=2e7+7;
const int M=1e9+7;
const int NN=2e5+7;
const int inf=1e9;
int c[N], tin[N], tout[N], eul[N], sz[N], big[N], t[N*4], l[N], r[N], szz;
vector <pair<int*, int>> rb;
int n, timer, cur, 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 dfs(int v=1){
	if(c[v])timer++;
        tin[v] = ++timer;
	eul[timer] = v;
	sz[v] = 1;
	if(!c[v]){
		dfs(l[v]);
		dfs(r[v]);
		sz[v] += sz[l[v]];
		sz[v] += sz[r[v]];
		if(sz[r[v]] > sz[l[v]])big[v] = r[v];
		else big[v] = l[v];	
	}
	
	tout[v] = timer;
}
void go(int v=1, int cl=0){
	int temp = rb.size();
	if(!c[v]){
		if(big[v] == l[v])go(r[v], 1);
		else go(l[v], 1);
		
		go(big[v], 0);
		int cntkeep=0, cntswap=0;
		if(big[v] == l[v]){
			for(int i=tin[r[v]]; i <= tout[r[v]]; i++){
				int f = eul[i];
				if(c[f]){
					cntkeep += get(c[f], n);
					cntswap += get(1, c[f]);
				}
			}
			if(!cl) {
				for(int i=tin[r[v]]; i <= tout[r[v]]; i++){
					int f = eul[i];
					if(c[f]){
						tupd(c[f]);
					}
				}
			}
		}
		else {
			for(int i=tin[l[v]]; i <= tout[l[v]]; i++){
				int f = eul[i];
				if(c[f]){
					cntkeep += get(1, c[f]);
					cntswap += get(c[f], n);
				}
			}
			if(!cl){
				for(int i=tin[l[v]]; i <= tout[l[v]]; i++){
					int f = eul[i];
					if(c[f]){
						tupd(c[f]);
					}
				}
			}
		}
		ans += min(cntkeep, cntswap);
		if(cl){
			while(temp < (int)rb.size()){
				*(rb.back().F) = rb.back().S;
				rb.pop_back();
			}
		}
	}
	else {
		if(!cl)tupd(c[v]);
	}
}
void rec(){
	cin >> c[szz];
	if(!c[szz]){
		int cur = szz;
		
		szz++;
		l[cur] = szz;
		rec();
		
		szz++;
		r[cur] = szz;
		rec();
	}
}
void AlemAmenov(){
	
	cin >> n;
	szz=1;
	rec();
	dfs();
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14800 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15020 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 2 ms 15196 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16376 KB Output is correct
2 Correct 9 ms 16092 KB Output is correct
3 Correct 5 ms 16348 KB Output is correct
4 Correct 5 ms 16348 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 21972 KB Output is correct
2 Correct 30 ms 19412 KB Output is correct
3 Correct 90 ms 28612 KB Output is correct
4 Correct 21 ms 21972 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 163 ms 37248 KB Output is correct
2 Correct 79 ms 39736 KB Output is correct
3 Correct 88 ms 40632 KB Output is correct
4 Correct 86 ms 43196 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 65492 KB Output is correct
2 Correct 127 ms 61928 KB Output is correct
3 Correct 163 ms 58708 KB Output is correct
4 Correct 115 ms 57776 KB Output is correct

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 194 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 527 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 283 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 349 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -