Submission #1035962

#	Time	Username	Problem	Language	Result	Execution time	Memory
1035962		ArthuroWich	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1 ms	348 KiB

shoes

#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> s) {
	int n = s.size(), ans1 = 0, ans2 = 0;
	vector<int> vis(n, 0);
	for (int i = 0; i < n; i++) {
		if (vis[i]) {
			continue;
		}
		int co = 0, ind = -1;
		for (int j = i+1; j < n; j++) {
			if (!vis[j] && s[i] == s[j]*-1) {
				vis[j] = 1;
				ind = j;
				break;
			}
			co++;
		}
		ans1 += co;
		if (s[ind] < 0) {
			ans1++;
		}
	}
	reverse(s.begin(), s.end());
	fill(vis.begin(), vis.end(), 0);
	for (int i = 0; i < n; i++) {
		if (vis[i]) {
			continue;
		}
		int co = 0, ind = -1;
		for (int j = i+1; j < n; j++) {
			if (!vis[j] && s[i] == s[j]*-1) {
				vis[j] = 1;
				ind = j;
				break;
			}
			co++;
		}
		ans2 += co;
		if (s[ind] > 0) {
			ans2++;
		}
	}
	return min(ans1, ans2);
}

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