제출 #584398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584398		KrisjanisP	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1090 ms	147216 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;

ll count_swaps(vector<int> s) {
	ll n = s.size();
	map<ll,queue<ll>> m;
	for(ll i=0;i<n;i++)
		m[s[i]].push(i);
	set<ll> erased;
	ll res = 0;
	for(ll i=0;i<n;i++)
	{
		if(erased.count(i)) continue;
		
		m[s[i]].pop();

		ll j = m[-s[i]].front();
		m[-s[i]].pop();
		
		res += j-i-1;
		if(s[i]>0) res++;
		for(ll k=i+1;k<j;k++)
			if(erased.count(k)) res--;

		erased.insert(i);
		erased.insert(j);
	}
	return res;
}

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