Submission #944365

#	Time	Username	Problem	Language	Result	Execution time	Memory
944365		pan	Arranging Shoes (IOI19_shoes)	C++17	100 / 100	135 ms	32636 KiB

shoes

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, srb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;

ll n, ans = 0;
unordered_map<ll, set<ll> > nxt;
// PURQ BIT
vector<ll> fenwick(200005,0);
 
ll ps(ll i)
{
	if (i==0) return 0;
	ll sum=0;
	while (i>0)
	{
		sum+=fenwick[i];
		i-=i&(-i);
	}
	return sum;
}
void update(ll i, ll v)
{
	while (i<=n+2)
	{
		fenwick[i]+=v;
		i+=i&(-i);
	}
}

ll rangequery(ll l, ll r)
{
	return ps(r)-ps(l-1);
}

long long count_swaps(std::vector<int> S)
{
	n = S.size();
	vector<bool> done(n+1, 0);
	for (ll i=1; i<=n; ++i) nxt[S[i-1]].insert(i);
	for (ll i=1; i<=n; ++i)
	{
		if (done[i]) continue;
		ll val = S[i-1];
		ll p = *(nxt[-val].begin());
		nxt[-val].erase(nxt[-val].begin());
		nxt[val].erase(nxt[val].begin());
		//show(p);
		ans += p-i-1-rangequery(i, p);
		if (val>0) ans++;
		update(p, 1);
		done[i] = done[p] = true;
	}
	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