제출 #1120878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120878		chuyenluaga	무제 (POI11_rot)	C++17	36 / 100	1051 ms	35588 KiB

Main

// Source: https://oj.uz/problem/view/POI11_rot
// State: Writing...

#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;

#define int long long
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;


int ans = 0;
Tree <int> solve(){
	int x;
	Tree<int> s1,s2;
	cin >> x;
	if (x != 0){
		s1.insert(x);
		return s1;
	}
	s1 = solve();
	s2 = solve();
	if (s1.size() < s2.size()) swap(s1,s2);

	//auto i1 = s1.begin(), i2 = s2.begin();
	int nghich = 0;
	for (int v : s2)
		nghich = nghich + s1.order_of_key(v);
	
	ans = ans + min(nghich,(int)s1.size()*(int)s2.size() - nghich);
	//cout << ans << endl;

	for (int v : s2){
		s1.insert(v);
	}
	return s1;
}


int32_t main() {
	int n;
	cin >> n;
	solve();
	cout << ans;
}

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