Submission #143895

#	Time	Username	Problem	Language	Result	Execution time	Memory
143895		tincamatei	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	2 ms	376 KiB

shoes

#include "shoes.h"
#include <vector>
#include <cstdlib>

using namespace std;

long long count_swaps(std::vector<int> s) {
	int N = s.size() / 2;
	vector<int> pozLeft(N, 0), pozRight(N, 0);

	for(int i = 0; i < 2 * N; ++i)
		if(s[i] < 0)
			pozLeft[-s[i] - 1] = i;
		else
			pozRight[s[i] - 1] = i;
	
	long long rez = 0LL;

	for(int i = 0; i < N; ++i) {
		rez = rez + abs(pozLeft[i] - pozRight[i]) - 1;
		if(pozLeft[i] > pozRight[i])
			++rez;
	}

	return rez;
}

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