제출 #1022684

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1022684		CodeAssignment	Arranging Shoes (IOI19_shoes)	C++17	100 / 100	128 ms	27856 KiB

shoes

#include <bits/stdc++.h>
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define trav(a, x) for (auto &a : x)
#define pb push_back
#define el "\n";
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag,
    tree_order_statistics_node_update>;

ll count_swaps(vector<int> S) {
	Tree<ll> t;

	ll n = sz(S) / 2; // number of pairs
	vi a = S;

	vector<bool> done(2 * n);
	vector<set<ll>> pos(2 * n + 1);
	rep(i, 0, 2*n) {
		pos[a[i] + n].insert(i);
	}

	ll ans = 0;
	ll ind = 0;
	while(ind < 2 * n) {
		if (done[ind]) {
			ind++;
			continue;
		}

		ll cur = a[ind];

		auto buddy = pos[-cur + n].upper_bound(ind);
		ll bigger_than_buddy = t.order_of_key(-(*buddy));
		ll bigger_than_ind = t.order_of_key(-ind);

		ans += (*buddy) - ind - (cur < 0 ? 1 : 0) + bigger_than_buddy - bigger_than_ind;

		t.insert(-(*buddy));
		pos[-cur + n].erase(*buddy);
		done[ind] = 1;
		done[*buddy] = 1;
		ind++;
	}
	return ans;
}

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