Submission #1034230

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034230		nickolasarapidis	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	1 ms	344 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

ll count_swaps(vector<int> S){
	long N = S.size();

	map<long, priority_queue<long>> m; 

	for(long i = 0; i < N; i++){
		m[S[i]].push(-i);
	}

	ll ans = 0;
	for(long i = 0; i < N; i++){
		if(S[i] < 0){
			ans += -m[S[i] + 2*S[i]].top() - i + 1;
		}
		else{
			ans += -m[S[i] + 2*S[i]].top() - i;
		}
	}

	return ans;
}

/*int main(){
	cout << count_swaps({2, 1, -1, -2});
	return 0;
}*/

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