Submission #143379

#	Time	Username	Problem	Language	Result	Execution time	Memory
143379		ondrah	Arranging Shoes (IOI19_shoes)	C++14	85 / 100	1016 ms	39504 KiB

shoes

#include "shoes.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <set>
#include <map>

using namespace std;
using namespace __gnu_pbds;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

long long count_swaps(std::vector<int> s) {
	long long ans = 0;
	int n = s.size();
	ordered_set els;
	map<int, set<int>> M;
	for(int i = 0; i < n; i++) {
		els.insert(i);
		M[s[i]].insert(i);
	}
	for(int i = 0; i < n; i++) {
		if(s[i] == n+2)
			continue;
		int j = *M[-s[i]].begin();
       M[s[i]].erase(M[s[i]].begin());
		M[-s[i]].erase(M[-s[i]].begin());
		int pos1 = els.order_of_key(i);
		int pos2 = els.order_of_key(j);
		els.erase(els.find(j));
		ans += pos2-pos1-1;

		if(s[i] > 0) ans++;
            s[i] = s[j] = n+2;
	}
	return ans;
}

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