oj.uz

답안 #1020537

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1020537 2024-07-12T06:47:47 Z BuzzyBeez Tree Rotations (POI11_rot) C++17
63 / 100
 108 ms 51280 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5;

int a[N + 8];
vector<int> adj[N + 8];
set<int> _list[N + 8];
long long inv[N + 8];
int sz[N + 8];

int n, tmp, id = 1;
void input() {
	int x; cin >> x;
	if (x) {_list[id].insert(x); ++sz[id]; a[id] = x; 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, int p) {for (int v : adj[u]) DFS_sz(v, u), sz[u] += sz[v];}

struct Binary_Indexed_Tree {
	vector<int> BIT;
	
	Binary_Indexed_Tree() {BIT.assign(N + 8, 0);}
	
	int pt;
	void update(int u, int v) {
		pt = u;
		while (pt <= N) {
			BIT[pt] += v;
			pt += pt & -pt;
		}
	}
	
	int res;
	int pf(int p) {
		if (p <= 0) return 0;
		res = 0; pt = p;
		while (pt) {
			res += BIT[pt];
			pt -= pt & -pt;
		}
		return res;
	}
	
	int range(int l, int r) {
		if (l > r) return 0;
		return pf(r) - pf(l - 1);
	}
} tree;

int costLR, costRL;
void DFS(int u, int p) {
	if (sz[u] > 1) { 
		int L = adj[u][0], R = adj[u][1];
		if (sz[L] < sz[R]) swap(L, R);
		// cout << u << " -> " << R << endl;
		DFS(R, u);
		inv[u] += inv[R];
		for (int item : _list[R]) tree.update(item, -1);
		// cout << u << " -> " << L << endl;
		DFS(L, u);
		inv[u] += inv[L];
		costLR = costRL = 0;
		for (int item : _list[R]) costLR += tree.range(item + 1, n), costRL += tree.range(1, item - 1);
		inv[u] += min(costLR, costRL);
		for (int item : _list[R]) tree.update(item, +1);
	}
	if (a[u]) tree.update(a[u], +1);
	for (int v : adj[u]) {
		if (_list[u].size() < _list[v].size()) swap(_list[u], _list[v]);
		for (int item : _list[v]) _list[u].insert(item);
	}
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n; input();
	DFS_sz(1, 0); 
	DFS(1, 0); cout << inv[1];
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 16216 KB Output is correct
2 Correct 10 ms 16360 KB Output is correct
3 Correct 8 ms 16216 KB Output is correct
4 Correct 7 ms 16476 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 18168 KB Output is correct
2 Correct 21 ms 19288 KB Output is correct
3 Correct 61 ms 28244 KB Output is correct
4 Correct 19 ms 19024 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 33876 KB Output is correct
2 Correct 55 ms 29576 KB Output is correct
3 Correct 58 ms 31316 KB Output is correct
4 Correct 54 ms 31824 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 36436 KB Output is correct
2 Correct 79 ms 37204 KB Output is correct
3 Correct 108 ms 39756 KB Output is correct
4 Correct 85 ms 34456 KB Output is correct

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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

Subtask #11
0 / 10.0

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