Submission #1020582

#	Time	Username	Problem	Language	Result	Execution time	Memory
1020582		thdh__	Untitled (POI11_rot)	C++17	100 / 100	174 ms	15956 KiB

Main

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ff(x,a,b,c) for (auto x=a;x<=b;x+=c)
#define fd(x,a,b,c) for (auto x=a;x>=b;x-=c)
#define int ll

using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

typedef pair<int, int> ii;
const int N = 1e6+5;
const int mod = 1e9+7;
const int INF = 1e18;
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

int n,idx,sz[N],l[N],r[N],bit[N],sum = 0,ans = 0;

//fenwick tree
void update(int x,int w)
{
	for (;x<=n+4;x += x&-x) bit[x] += w;
}

int get(int x)
{
	int res = 0;
	for (;x>0;x -= x & -x) res += bit[x];
	return res;
}

void push(int u)
{
	if (u<=n) 
	{
		update(u,-1); return;
	}
	push(l[u]); push(r[u]);
}

void cal(int u)
{
	if (u<=n)
	{
		sum += get(n)-get(u); return;
	}
	cal(l[u]); cal(r[u]);
}

void push1(int u)
{
	if (u<=n) 
	{
		update(u,1); return;
	}
	push1(l[u]); push1(r[u]);
}

void dfs(int u)
{
	if (u<=n) 
	{
		update(u,1); return;
	}
	//cout<<r[u]<<" "<<l[u]<<endl;
	dfs(r[u]); 
	push(r[u]); 
	dfs(l[u]);
	sum = 0;
	cal(r[u]); push1(r[u]);
	ans += min(sum, sz[l[u]]*sz[r[u]]-sum);
}

int init()
{
	int x; cin>>x; 
    if(x){
        sz[x] =1 ;
        return x; 
    }
    idx++;
    int i = idx - 1; 
    l[i] = init();
    r[i] = init();
	//cout<<i<<endl<<l[i]<<" "<<r[i]<<endl;
    sz[i] = sz[l[i]] + sz[r[i]]; 
    if(sz[l[i]] < sz[r[i]])swap(l[i],r[i]) ;
    return i;
}

void solve()
{
	cin>>n;
	idx = n+1;
	int root = init();
	//cout<<root<<endl;
	dfs(root);
	cout<<ans;
}

signed main()
{
	bruh
	//freopen("input.inp","r",stdin);
	//freopen("output.inp","w",stdout);
	int t = 1;
	//cin>>t;
	while (t--)
	{
		solve();
		cout<<"\n";
	}
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9
• Subtask 11: 10 / 10