제출 #486803

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
486803		Haidara	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	5 ms	9676 KiB

shoes

#include<bits/stdc++.h>
#include<shoes.h>
#define rep(i,x,n) for(int i=(x);i<(n);i++)
#define FOR(i,n) rep(i,0,n)
#define v(i) vector< i >
#define ll long long 
using namespace std;
const ll inf=1LL<<62LL;
const ll mod=1e9+7;
const ll maxn=100200;
ll count_swaps(v(int)a)
{
	ll ans=0;
	ll n=a.size();
	set<int>posl[maxn],posr[maxn];
	FOR(i,n)
	if(a[i]<0)
		posl[-a[i]].insert(i);
	else 
		posr[a[i]].insert(i);
	
	v(bool)vis(maxn,0);
	for(int i=0;i<n;i++)
	{
		if(vis[i])
			continue;
		if(a[i]>0)
			ans++;
		if(a[i]<0)
			a[i]*=-1;
		vis[*posr[a[i]].begin()]=1;
		vis[*posl[a[i]].begin()]=1;
		ans+=abs(*posr[a[i]].begin()-*posl[a[i]].begin());
		posl[a[i]].erase(posl[a[i]].begin());
		posr[a[i]].erase(posr[a[i]].begin());
	}
	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