Submission #810209

#	Time	Username	Problem	Language	Result	Execution time	Memory
810209		Sohsoh84	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1083 ms	24224 KiB

shoes

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

using namespace std;

typedef long long ll;
typedef pair<int, int> pll;

#define X		first
#define Y		second
#define sep		' '

const int MAXN = 2e6 + 10;

int n;
map<int, vector<int>> mp;

ll count_swaps(vector<int> vec) {
	ll ans = 0;
	n = vec.size();
	for (int i = n - 1; i >= 0; i--)
		mp[vec[i]].push_back(i);
	
	for (int i = 0; i < n; i += 2) {
		for (int j = i + 1; j < n; j++) {
			if (vec[j] == -vec[i]) {
				for (int k = j; k > i + 1; k--)
					swap(vec[k], vec[k - 1]), ans++;

				break;
			}
		}

		if (vec[i] > vec[i + 1]) {
			swap(vec[i], vec[i + 1]);
			ans++;
		}
	}

	return ans;
}

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