Submission #526049

#	Time	Username	Problem	Language	Result	Execution time	Memory
526049		benjaminkleyn	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	20 ms	3088 KiB

shoes

#include "shoes.h"
#include <math.h>

long long count_swaps(std::vector<int> s) {
	int n = s.size() / 2;
	if (n == 1) return (s[0] > 0);
	bool samesize = true;
	for (int i = 0; i < 2 * n; i++)
		if (s[i] != s[0])
		{
			samesize = false;
			break;
		}
	if (samesize)
	{
		std::vector<int> lefts;
		for (int i = 0; i < 2 * n; i++)
			if (s[i] < 0) lefts.push_back(i);

		int res = 0;
		for (int i = 0; i < n; i++)
			res += abs(lefts[i] - i * 2);
		return res;
	}
	return 1;
}

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