Submission #928967

#	Time	Username	Problem	Language	Result	Execution time	Memory
928967		AtabayRajabli	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	1 ms	348 KiB

shoes

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

long long count_swaps(std::vector<int> s) {
	int N = s.size() / 2;
	std::map<int, std::set<int>> mp;

	for(int i = 0; i < N * 2; i++)
	{
		mp[s[i]].insert(i);
	}	

	long long ans = 0;
	for(int i = 0; i < N * 2; i++)
	{
		if(mp[s[i]].empty())continue;
		auto it = mp[-s[i]].upper_bound(i);
		int ind = *it;
		if(s[i] < 0)ans += ind - i - 1;
		else ans += ind - i + 1;
		mp[-s[i]].erase(it);
	}
	return ans;
}	

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