제출 #1120698

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120698		chuyenluaga	무제 (POI11_rot)	C++17	45 / 100	1041 ms	24404 KiB

Main

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


#include <bits/stdc++.h>
using namespace std;
int ans = 0;
set <int> solve(){
	int x;
	set<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 count = 0,nghich = 0;
	while (i2 != s2.end()){
		while (*i1 < *i2 && i1 != s1.end()){
			i1++;
			count++;
		}
		nghich = nghich + count;
		i2++;
	}
	ans = ans + min(nghich,(int)s1.size()*(int)s2.size() - nghich);
	//cout << ans << endl;
	for (int v : s2){
		s1.insert(v);
	}
	return s1;
}


int 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: 9 / 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