Submission #1275344

#	Time	Username	Problem	Language	Result	Execution time	Memory
1275344		rafsanamin2020	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	243 ms	145912 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"

using namespace std;

const int MX = 10;

vector<bool> paired(MX, false);
map<int, queue<int>> nxt;

vector<int> tree(4 * MX, 0);

void update(int l, int r, int x = 0, int lo = 0, int hi = MX - 1)
{
	if (r < lo || l > hi || r > l)
		return;

	if ((lo == l && hi == r))
	{
		tree[x]++;
		return;
	}

	int mid = (lo + hi) / 2;

	update(l, min(mid, r), 2 * x + 1, lo, mid);
	update(max(l, mid + 1), r, 2 * x + 2, mid + 1, hi);
}

int query(int t, int x = 0, int lo = 0, int hi = MX - 1)
{
	if (t < lo || t > hi)
		return 0;

	if (lo == hi && lo == t)
	{
		return tree[x];
	}

	int mid = (lo + hi) / 2;

	return query(t, 2 * x + 1, lo, mid) + query(t, 2 * x + 2, mid + 1, hi) + tree[x];
}

long long count_swaps(std::vector<int> s)
{
	long long N = s.size(), ans = 0;

	for (int i = 0; i < N; i++)
	{
		nxt[s[i]].push(i);
	}

	for (int i = 0; i < N; i++)
	{
		if (paired[i])
			continue;

		int j = nxt[-s[i]].front();
		nxt[-s[i]].pop();

		update(i + 1, j - 1);

		ans += (j + query(j)) - (i + query(i)) - (s[i] < 0 ? 1 : 0);

		paired[j] = true;
	}

	return ans;
}

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