Submission #1217676

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

shoes

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

long long count_swaps(vector<int> S){
	int N = S.size()/2;
	map<int, vector<int>> m;
	long long ans = 0;
	for(int i = 0; i < S.size(); i++){
		if(S[i] > 0 and m[-S[i]].size() > 0){
			ans += i - m[-S[i]].back() + 1;
			m[-S[i]].pop_back();
		}
		else if(S[i] < 0 and m[-S[i]].size() > 0){
			ans += i - m[-S[i]].back();
			m[-S[i]].pop_back();
		}
		else{
			m[S[i]].push_back(i);
		}
	}
	return ans;
}

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