oj.uz

Submission #1020585

# Submission time Handle Problem Language Result Execution time Memory
1020585 2024-07-12T07:17:39 Z BuzzyBeez Tree Rotations (POI11_rot) C++17
72 / 100
 158 ms 35660 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 4e5;

int a[N + 8];
int adj[N + 8][2];
vector<int> _list[N + 8];
int sz[N + 8];

int n, tmp, id = 1, x;
void input() {
	cin >> x;
	if (x) {_list[id].push_back(x); ++sz[id]; a[id] = x; return;}
	int t = id;
	adj[t][0] = id + 1;
	++id; input();
	adj[t][1] = id + 1;
	++id; input();
}

void DFS_sz(int u, int p) {
	if (!adj[u][0]) return;
	DFS_sz(adj[u][0], u); sz[u] += sz[adj[u][0]];
	DFS_sz(adj[u][1], u); sz[u] += sz[adj[u][1]];
}

struct Binary_Indexed_Tree {
	vector<int> BIT;
	
	Binary_Indexed_Tree() {BIT.assign(N / 2 + 8, 0);}
	
	int pt;
	void update(int u, int v) {
		pt = u;
		while (pt <= N / 2) {
			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; long long ans = 0;
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);
		for (int item : _list[R]) tree.update(item, -1);
		// cout << u << " -> " << L << endl;
		DFS(L, u);
		costLR = costRL = 0;
		for (int item : _list[R]) costLR += tree.range(item + 1, n), costRL += tree.range(1, item - 1);
		ans += min(costLR, costRL);
		// cout << u << ' ' << costLR << ' ' << costRL << '\n';
		for (int item : _list[R]) tree.update(item, +1);
		for (int v : {L, R}) {
			if (_list[u].size() < _list[v].size()) swap(_list[u], _list[v]);
			for (int item : _list[v]) _list[u].push_back(item);
		}
	}
	if (a[u]) tree.update(a[u], +1);
}

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 << ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10588 KB Output is correct
2 Correct 6 ms 10588 KB Output is correct
3 Correct 4 ms 10664 KB Output is correct
4 Correct 4 ms 10588 KB Output is correct
5 Correct 6 ms 10588 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10604 KB Output is correct
2 Correct 5 ms 10588 KB Output is correct
3 Correct 5 ms 10588 KB Output is correct
4 Correct 4 ms 10632 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10584 KB Output is correct
2 Correct 8 ms 10588 KB Output is correct
3 Correct 6 ms 10588 KB Output is correct
4 Correct 6 ms 10756 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11096 KB Output is correct
2 Correct 7 ms 11000 KB Output is correct
3 Correct 6 ms 11100 KB Output is correct
4 Correct 8 ms 11356 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12480 KB Output is correct
2 Correct 14 ms 11784 KB Output is correct
3 Correct 30 ms 13916 KB Output is correct
4 Correct 12 ms 12380 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 15820 KB Output is correct
2 Correct 35 ms 16924 KB Output is correct
3 Correct 43 ms 18768 KB Output is correct
4 Correct 31 ms 18780 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 25308 KB Output is correct
2 Correct 40 ms 22100 KB Output is correct
3 Correct 56 ms 20436 KB Output is correct
4 Correct 42 ms 18380 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 20192 KB Output is correct
2 Correct 58 ms 22168 KB Output is correct
3 Correct 56 ms 26316 KB Output is correct
4 Correct 52 ms 26036 KB Output is correct

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 158 ms 32428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 27584 KB Output is correct
2 Incorrect 105 ms 35660 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 106 ms 28084 KB Output isn't correct
2 Halted 0 ms 0 KB -