oj.uz

Submission #766103

# Submission time Handle Problem Language Result Execution time Memory
766103 2023-06-25T10:12:21 Z vjudge1 Tree Rotations (POI11_rot) C++14
100 / 100
 780 ms 38076 KB 
#include <bits/stdc++.h>
using namespace std;
 
// #pragma comment(linker, "/stack:2000000000")
// #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define precise(a) cout<<fixed<<setprecision(a)
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
// t1
const ll mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const ll N = ll(4e5)+10;
const ll inf = 1e18;
const ld eps = 1e-15L;
const ll B = 400;
// const ld pie = acos(-1.0);
 
ll lcm(ll a, ll b){ return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m){ ll res=1;a%=m; while(b>0){ if(b&1)res=(res*a)%m; a=(a*a)%m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, lc[N], rc[N], node, siz[N], t[N*4];
ll ans[N];
vector<int> val[N];

int read() {
	++node;
	int root = node;
	siz[root] = 1;
	int v; cin>>v;
	if(v == 0) {
		lc[root] = read();
		rc[root] = read();
		siz[root] = siz[lc[root]] + siz[rc[root]];
 		return root;
	}
	else {
		val[root].pb(v);
		lc[root] = rc[root] = -1;
		return root;
	}
}

//void update(int p, int x) {
//	while(p <= n) {
//		fenwin[p] += x;
//		p += (p&-p);
//	}
//}
//
//int got(int x) {
//	int res = 0;
//	while(x >= 1) {
//		res += fenwin[x];
//		x -= (x & -x);
//	}
//	return res;
//}
void update(int v, int tl, int tr, int p, int x) {
	if(tl == tr) {
		t[v] += x;
		return;
	}
	int tm = (tl + tr) / 2;
	if(p <= tm) update(v+v, tl, tm, p, x);
	else update(v+v+1, tm + 1, tr, p, x);
	t[v] = t[v+v] + t[v+v+1];
}

int get(int v, int tl, int tr, int l, int r) {
	if(tl > r || l > tr) return 0;
	if(l <= tl && tr <= r) return t[v];
	int tm = (tl + tr) / 2;
	return get(v+v, tl, tm, l, r) + get(v+v+1, tm+1, tr, l, r);
}

//int get(int l, int r) {
//	return got(r) - got(l - 1);
//}




void dfs(int v, bool clear) {
	if(lc[v] == -1) {
		if(!clear) {
			for(auto x : val[v]) update(1, 1, n, x, 1);
		}
		return;
	}
	if(siz[lc[v]] < siz[rc[v]]) {
		dfs(lc[v], 1);
		dfs(rc[v], 0);
		
		// light ... heavy
		ll ex = 0;
		for(auto x : val[lc[v]]) ex += get(1, 1, n, 1, x-1);
		ll ans1 = ans[lc[v]] + ans[rc[v]] + ex;
		ex = 0;
		// heavy light
		for(auto x : val[lc[v]]) ex += get(1, 1, n, x+1, n);
		ll ans2 = ans[rc[v]] + ans[lc[v]] + ex;
		if(clear) {
			for(auto x : val[rc[v]]) update(1, 1, n, x, -1);
		}
		if(ans1 < ans2) {
			ans[v] = ans1;
		}
		else {
			ans[v] = ans2;
		}
		val[v].swap(val[rc[v]]);
		for(auto x : val[lc[v]]) val[v].pb(x);
		if(!clear) for(auto x : val[lc[v]]) update(1, 1, n,  x, 1);
	}
	else {
		dfs(rc[v], 1);
		dfs(lc[v], 0);
		// light ... heavy
		ll ex = 0;
		for(auto x : val[rc[v]]) ex += get(1, 1, n, 1, x-1);
		ll ans1 = ans[rc[v]] + ans[lc[v]] + ex;
		ex = 0;
		// heavy light
		for(auto x : val[rc[v]]) ex += get(1, 1, n, x+1, n);
		ll ans2 = ans[lc[v]] + ans[rc[v]] + ex;
//		if(v == 17) {
//			cout<<"HEREol\n";
//			cout<<ans1<<" "<<ans2<<"\n";
//		}
		if(clear) {
			for(auto x : val[lc[v]]) update(1, 1, n, x, -1);
		}
		if(ans1 < ans2) {
			ans[v] = ans1;
		}
		else {
			ans[v] = ans2;
		}
		val[v].swap(val[lc[v]]);
		for(auto x : val[rc[v]]) val[v].pb(x);
		if(!clear) for(auto x : val[rc[v]]) update(1, 1, n, x, 1);
	}
//	cout<<v<<" "<<ans[v]<<"\n";
//	for(auto x : val[v]) cout<<x<<" ";
//	cout<<"\n";
//	if(v == 5) {
//		cout<<"HERE\n";
//		cout<<lc[v]<<" "<<rc[v]<<" "<<ans[lc[v]]<<" "<<ans[rc[v]]<<"\n";
//		for(auto x : val[lc[v]]) cout<<x<<" ";
//		cout<<"\n";
//		for(auto x : val[rc[v]]) cout<<x<<" ";
//		cout<<"\n";
//	}
 	
	
}

void Baizho()
{
	cin>>n;
	read();
	dfs(1, 0);
	cout<<ans[1];
}

 
int main() {
 
//     Freopen("disrupt");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//    precalc();
   
    int ttt = 1;
//    cin>>ttt;

    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

rot.cpp: In function 'void Freopen(std::string)':
rot.cpp:33:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rot.cpp:33:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10324 KB Output is correct
2 Correct 11 ms 10208 KB Output is correct
3 Correct 7 ms 10396 KB Output is correct
4 Correct 6 ms 10564 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 11860 KB Output is correct
2 Correct 29 ms 11092 KB Output is correct
3 Correct 84 ms 13260 KB Output is correct
4 Correct 23 ms 11740 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 15460 KB Output is correct
2 Correct 70 ms 16568 KB Output is correct
3 Correct 81 ms 18380 KB Output is correct
4 Correct 75 ms 18524 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 25304 KB Output is correct
2 Correct 96 ms 22332 KB Output is correct
3 Correct 144 ms 20692 KB Output is correct
4 Correct 93 ms 18476 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 20688 KB Output is correct
2 Correct 138 ms 22472 KB Output is correct
3 Correct 118 ms 26696 KB Output is correct
4 Correct 123 ms 26460 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 507 ms 33900 KB Output is correct
2 Correct 278 ms 30152 KB Output is correct
3 Correct 243 ms 29032 KB Output is correct
4 Correct 324 ms 28812 KB Output is correct
5 Correct 595 ms 30716 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 29000 KB Output is correct
2 Correct 268 ms 37252 KB Output is correct
3 Correct 332 ms 35272 KB Output is correct
4 Correct 211 ms 38076 KB Output is correct
5 Correct 736 ms 33764 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 29440 KB Output is correct
2 Correct 245 ms 30840 KB Output is correct
3 Correct 544 ms 31428 KB Output is correct
4 Correct 346 ms 30220 KB Output is correct
5 Correct 204 ms 37948 KB Output is correct
6 Correct 780 ms 34764 KB Output is correct