Submission #143321

#	Time	Username	Problem	Language	Result	Execution time	Memory
143321		VladaMG98	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1081 ms	1960 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
#include "shoes.h"
long long count_swaps(std::vector<int> s) {
	int n = (int)s.size() / 2;
	int N = 2 * n;
	long long ans = 0;
	for(int pos = 0; pos < n; pos++) {
        //printf("pos = %d\n", pos);
        int target = -s[2 * pos];
        int fnd = -1;
		for(int i = 2 * pos + 1; i < N; i++) {
			if(s[i] == target) {
				fnd = i;
				break;
			}
		}
		assert(fnd + 1);
		for(int i = fnd - 1; i >= 2 * pos + 1; i--) {
			swap(s[i], s[i + 1]);
			ans += 1;
		}
		if(s[2 * pos] > 0) {
            swap(s[2 * pos], s[2 * pos + 1]);
            ans += 1;
		}
        //printf("ans = %d\n", 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