제출 #525974

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
525974		Hanksburger	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	39 ms	25804 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
vector<long long> pos1[100005], pos2[100005];
long long a[100005];
bool b[100005];
long long f(long long l, long long r)
{
	if (l==r)
		return 0;
	long long mid=(l+r)/2, index=(l+r)/2+1;
	long long res=f(l, mid)+f(mid+1, r);
	for (long long i=l; i<=mid; i++)
	{
		while (index<=r && a[i]>a[index])
			index++;
		res+=index-mid-1;
	}
	sort(a+l, a+r+1);
	return res;
}
long long count_swaps(vector<int> v)
{
	long long m=v.size(), cnt=0;
	for (long long i=0; i<m; i++)
	{
		if (v[i]<0)
			pos1[-v[i]].push_back(i);
		else
			pos2[v[i]].push_back(i);
	}
	for (long long i=1; i<=m; i++)
	{
		reverse(pos1[i].begin(), pos1[i].end());
		reverse(pos2[i].begin(), pos2[i].end());
	}
	for (long long i=0; i<m; i++)
	{
		if (b[i])
			continue;
		if (v[i]<0)
		{
			cnt+=2;
			a[i]=cnt-1;
			int tmp=pos2[-v[i]].size();
			a[pos2[-v[i]][tmp-1]]=cnt;
			b[pos2[-v[i]][tmp-1]]=1;
			pos1[-v[i]].pop_back();
			pos2[-v[i]].pop_back();
		}
		else
		{
			cnt+=2;
			a[i]=cnt;
			int tmp=pos1[v[i]].size();
			a[pos1[v[i]][tmp-1]]=cnt-1;
			b[pos1[v[i]][tmp-1]]=1;
			pos1[v[i]].pop_back();
			pos2[v[i]].pop_back();
		}
	}
	return f(0, m-1);
}

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