oj.uz

Submission #862031

# Submission time Handle Problem Language Result Execution time Memory
862031 2023-10-17T11:58:49 Z vjudge1 Tree Rotations (POI11_rot) C++17
63 / 100
 234 ms 52604 KB 
//order_of_key(k): Number of items strictly smaller than k .
//find_by_order(k): K-th element in a set (counting from zero).

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define file(s) if(fopen(s".in","r")) freopen(s".in","r",stdin);freopen(s".out","w",stdout)
#define all(x) (x).begin(), (x).end()
#define len(x) (int)x.size()
#define tm (tl + tr >> 1)
#define ls v << 1, tl, tm
#define rs v << 1 | 1, tm + 1, tr
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define elif else if
#define F first
#define S second
#define int long long

using namespace std;
using namespace __gnu_pbds;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
typedef long double ld;

const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
const int P = 911;
const ll INF = 1e18;

int rnd() {
	int x = rand() << 15;
	return x ^ rand();
}

vector <int> g[N];
int sz[N], res[N], ans, cnt[N], a[N], n, t[N << 2];
int id[N];
vector <int> vc[N];

void upd(int idx, int val, int v = 1, int tl = 1, int tr = n) {
	if (tl == tr) {
		t[v] += val;
		return;
	}
	if (idx <= tm) upd(idx, val, ls);
	else upd(idx, val, rs);
	t[v] = t[v << 1] + t[v << 1 | 1];
}

int get(int l, int r, int v = 1, int tl = 1, int tr = n) {
	if (l > r) return 0;
	if (l <= tl && tr <= r) {
		return t[v];
	}
	elif (r < tl || tr < l) return 0;
	return get(l, r, ls) + get(l, r, rs);
}

void calc(int v = 1, int pr = 0) {
	id[v] = v;
	sz[v] = 1;
	for (int u: g[v]) if (u != pr) {
		calc(u, v);
		sz[v] += sz[u];
	}
}

void add(int v) {
	if (!a[v]) return;
	upd(a[v], 1);
}

void clr(int v) {
	if (!a[v]) return;
	upd(a[v], -1);
}

void dadd(int v) {
	add(v);
	for (int u: g[v]) {
		dadd(u);
	}
}

void dclr(int v) {
	clr(v);
	for (int u: g[v]) {
		dclr(u);
	}
}


void dfs(int v = 1, bool act = 0) {
	int to = 0;
	for (int u: g[v]) {
//		cout << "dd " << v << ' ' << u << '\n'; 
		if (sz[u] > sz[to]) {
			to = u;
		}
	}
	for (int u: g[v]) {
		if (u != to) {
			dfs(u, 1);
			id[v] = id[u];
		}
	}
	if (to) dfs(to, 0);
	int cur1 = 0, cur2 = 0;
//	cout << "ans " << v << '\n';
	for (int it: vc[id[v]]) {
		cur1 += get(it + 1, n);
		cur2 += get(1, it - 1);
		if (id[to]) vc[id[to]].pb(it);
//		cout << it << ' ' << cur1 << ' ' << cur2 << '\n';
	}
	if (to) id[v] = id[to];
	ans += min(cur1, cur2);
	if (a[v]) {
//		cout << v << ' ' << a[v] << ' ' << id[v] << '\n';
		vc[id[v]].pb(a[v]);
	}
	add(v);
	for (int u: g[v]) if (u != to) {
		dadd(u);
	}
	if (act) {
		dclr(v);
		return;
	}
}

int temp = 1;
set <int> st;
map <int, int> mp;

void input(int v) {
	int x;
	cin >> x;
	if (x) {
		st.insert(x);
		a[v] = x;
		return;
	}
	temp++;
	g[v].pb(temp);
	input(temp);
	temp++;
	g[v].pb(temp);
	input(temp);
}

void GazizMadi() {
	cin >> n;
	input(1);
	for (int it: st) {
		mp[it] = len(mp) + 1;
	}
	for (int i = 1; i <= temp; i++) {
		a[i] = mp[a[i]];
	}
	calc();
	dfs();
	cout << ans;
}

const bool Cases = 0;

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	srand(time(0));
	int TT = 1;
	if (Cases) cin >> TT;
	for (int i = 1; i <= TT; i++) {
		//cout << "Case " << i << ": ";
		GazizMadi();
	}
}

Compilation message

rot.cpp: In function 'void upd(long long int, long long int, long long int, long long int, long long int)':
rot.cpp:13:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 | #define tm (tl + tr >> 1)
      |             ~~~^~~~
rot.cpp:54:13: note: in expansion of macro 'tm'
   54 |  if (idx <= tm) upd(idx, val, ls);
      |             ^~
rot.cpp:13:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 | #define tm (tl + tr >> 1)
      |             ~~~^~~~
rot.cpp:14:24: note: in expansion of macro 'tm'
   14 | #define ls v << 1, tl, tm
      |                        ^~
rot.cpp:54:31: note: in expansion of macro 'ls'
   54 |  if (idx <= tm) upd(idx, val, ls);
      |                               ^~
rot.cpp:13:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 | #define tm (tl + tr >> 1)
      |             ~~~^~~~
rot.cpp:15:24: note: in expansion of macro 'tm'
   15 | #define rs v << 1 | 1, tm + 1, tr
      |                        ^~
rot.cpp:55:21: note: in expansion of macro 'rs'
   55 |  else upd(idx, val, rs);
      |                     ^~
rot.cpp: In function 'long long int get(long long int, long long int, long long int, long long int, long long int)':
rot.cpp:13:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 | #define tm (tl + tr >> 1)
      |             ~~~^~~~
rot.cpp:14:24: note: in expansion of macro 'tm'
   14 | #define ls v << 1, tl, tm
      |                        ^~
rot.cpp:65:19: note: in expansion of macro 'ls'
   65 |  return get(l, r, ls) + get(l, r, rs);
      |                   ^~
rot.cpp:13:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 | #define tm (tl + tr >> 1)
      |             ~~~^~~~
rot.cpp:15:24: note: in expansion of macro 'tm'
   15 | #define rs v << 1 | 1, tm + 1, tr
      |                        ^~
rot.cpp:65:35: note: in expansion of macro 'rs'
   65 |  return get(l, r, ls) + get(l, r, rs);
      |                                   ^~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17756 KB Output is correct
2 Correct 3 ms 17780 KB Output is correct
3 Correct 3 ms 17756 KB Output is correct
4 Correct 4 ms 18012 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 18776 KB Output is correct
2 Correct 13 ms 20808 KB Output is correct
3 Correct 9 ms 21084 KB Output is correct
4 Correct 8 ms 21132 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23132 KB Output is correct
2 Correct 38 ms 22612 KB Output is correct
3 Correct 124 ms 27216 KB Output is correct
4 Correct 27 ms 23276 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 31404 KB Output is correct
2 Correct 111 ms 32420 KB Output is correct
3 Correct 136 ms 35048 KB Output is correct
4 Correct 124 ms 35404 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 44772 KB Output is correct
2 Correct 170 ms 42268 KB Output is correct
3 Correct 234 ms 40392 KB Output is correct
4 Correct 166 ms 38352 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 62 ms 47696 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 50 ms 43324 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 60 ms 48720 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 62 ms 52604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -