Submission #143372

#	Time	Username	Problem	Language	Result	Execution time	Memory
143372		ondrah	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1073 ms	1948 KiB

shoes

#include "shoes.h"

long long count_swaps(std::vector<int> s) {
	long long ans = 0;
	int n = s.size();
	for(int i = 0; i < n; i++) {
		if(s[i] == n+2)
			continue;
		int pen = 0;
		for(int j = i+1; j < n; j++) {
			if(s[i] == -s[j]) {
				ans += pen;
				if(s[i] > 0) ans++;
				s[i] = s[j] = n+2;
				break;
			}
			if(s[j] != n+2)
				pen++;
		}
	}
	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