제출 #249176

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249176		Dilshod_Imomov	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1098 ms	27764 KiB

shoes

# include <bits/stdc++.h>
# define ll long long
using namespace std;

ll  count_swaps( vector < int > s ) {
	ll  n = s.size(), ans = 0, sz = 0;
	vector < ll  > ids, used(n);
	map < ll , vector < ll  > > vc; 
	for ( ll  i = 0; i < n; i++ ) {
		vc[s[i]].push_back( i );
	}
	// cout << "Done 1" << endl;
	for ( ll  i = 0; i < n; i++ ) {
		if ( used[i] ) {
			continue;
		}
		ll  l = i, r = *vc[-s[i]].begin();
		// cout << "Done 2 " << l << ' ' << r << '\n';
		vc[ s[i] ].erase( vc[ s[i] ].begin() );
		ll  rr = r;
		used[r] = 1;
		vc[-s[i]].erase( vc[-s[i]].begin() );
		ll  x = upper_bound( ids.begin(), ids.end(), i ) - ids.begin();
		x = sz - x;
		l += x;
		x = upper_bound( ids.begin(), ids.end(), r ) - ids.begin();
		x = sz - x;
		r += x;
		ans += r - l - 1;
		if ( s[i] > 0 ) {
			ans++;
		}
		sz++;
		ids.push_back( rr );
	}
	return ans; 
}
/*
int main() {
	ll  n;
	cin >> n;
	vector < ll  > S(2 * n);  
	for ( ll  i = 0; i < 2 * n; i++ ) {
		cin >> S[i];
	}
	// cout << count_swaps( S );
}*/

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15