제출 #155977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
155977		GioChkhaidze	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	2 ms	380 KiB

shoes

#include "shoes.h"
using namespace std;
const int N=100005;
int a[2*N],G[2*N],f1[2*N],f2[2*N];
 
void Upd(int x,int dl) {
	while (x<=2*N) {
		G[x]+=dl;
		x+=(x & -x);
	}
}
 
int Get(int x) {
	int res=0;
	while (0<x) {
		res+=G[x];
		x-=(x & -x);
	}
	return res;
}
 
long long count_swaps(std::vector<int> s) {
	long long ans=0;
  	int n=s.size();
	for (int i=0; i<n; i++) {
		a[i+1]=s[i];
		if (a[i+1]>0) f1[a[i+1]]=i+1;
		if (a[i+1]<0) f2[-a[i+1]]=i+1;
		Upd(i+1,1);
	}
	
	for (int i=1; i<=n/2; i++) {
		int l=1,r=n,mid,idx=-1;
		
		while (l<=r) {
			mid=(l+r)/2;
			if (1<=Get(mid)) { idx=mid; r=mid-1; } 
								   else l=mid+1;
		}
		
		if (a[idx]<0) {
			int x=-a[idx];
			ans+=Get(f1[x]-1)-1;
			Upd(idx,-1);
			Upd(f1[x],-1);
		}
			else {
			int x=a[idx];
			ans+=Get(f2[x]-1);
			Upd(idx,-1);
			Upd(f2[x],-1);
		}
	}
	
	return ans;
}

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