IOI 2019 – Arranging Shoes Problem and Solution

IOI 2019 – Arranging Shoes Problem and Solution

The 31st International Olympiad in Informatics was held in Baku, Azerbaijan in 2019. There were two competition days, with 3 tasks given to the competitors on each day. You can see Arranging Shoes Problem and Solution below.

Problem :


Solution :

#include "shoes.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 200005;

struct bit{
	int tree[MAXN];
	void add(int x, int v){
		for(int i=x; i<MAXN; i+=i&-i) tree[i] += v;
	int query(int x){
		int ret = 0;
		for(int i=x; i; i-=i&-i) ret += tree[i];
		return ret;

lint count_swaps(std::vector<int> s) {
	int n = sz(s) / 2;
	lint ret = 0;
	vector<pi> v;
	vector<pi> ord[MAXN];
	for(int i=0; i<sz(s); i++){
		ord[abs(s[i])].emplace_back(s[i], i);
	for(int i=1; i<=n; i++){
		sort(ord[i].begin(), ord[i].end());
		for(int j=0; j<sz(ord[i])/2; j++){
			int l = ord[i][j].second;
			int r = ord[i][j + sz(ord[i])/2].second;
			if(l > r){
				swap(l, r);
			v.emplace_back(l + 1, r + 1);
	for(int i=1; i<=2*n; i++) bit.add(i, 1);
	sort(v.begin(), v.end());
	for(auto &i : v){
		ret += bit.query(i.second - 1) - bit.query(i.first);
		bit.add(i.first, -1);
		bit.add(i.second, -1);
	return ret;

Explanation :


 870 total views,  7 views today

Post Disclaimer

The hole problem statement are given by but the solution are generated by the sltechacademy authority if any of the query regarding this post or website fill the following contact form thank you. 

Leave a Reply

Your email address will not be published. Required fields are marked *