제출 #156029

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156029		giorgikob	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	228 ms	36420 KiB

shoes

#include "shoes.h"
int n,r,pos,l,x;
 
long long ans;
 
std::vector<int>locl[500001],locr[500001],s;

int fix[500001];
int indl[500001],indr[500001];
 
int tree[800001];
void upd(int node,int tl,int tr,int pos){
	
	if(tl==tr){
		tree[node] = 1;
		return;
	}
	
	int mid = (tl+tr)/2;
	
	if(pos<=mid)
		upd(node*2,tl,mid,pos);
	else
		upd(node*2+1,mid+1,tr,pos);
	
	tree[node] = tree[node*2] + tree[node*2+1];
}
 
int get(int node,int tl,int tr){
	
	if(r<tl || tr<l)return 0;
	
	if(tr<=r && l<=tl)return tree[node];
	
	int mid = (tr+tl)/2;
	
	int x = get(node*2,tl,mid);
	int y = get(node*2+1,mid+1,tr);
	
	return x+y;
}
 
long long count_swaps(std::vector<int> s) {
	n = s.size();
	for(int i=0;i<n;i++){
		if(s[i]<0){
			locl[-s[i]].push_back(i);
		} else {
			locr[s[i]].push_back(i);
		}
	}
	
	for(int i=0;i<n;i++)
	if(!fix[i]){
		if(s[i]<0){
			int loc = locr[ -s[i] ][ indr[ -s[i] ] ];
			//cout<<loc<<" 1111"<<endl;
			r = loc;
			l = i+1;
			ans += loc - i - 1 - get(1,0,n-1);
			//cout<<ans<<" 111"<<endl;
			indr[ -s[i] ] ++;
			indl[ -s[i] ] ++;
			fix[loc]=1;
			upd(1,0,n-1,loc);
			
		} else {
			int loc = locl[ s[i] ][ indl[ s[i] ] ];
			//cout<<loc<<endl;
			r = loc;
			l = i+1;
			ans += loc - i - get(1,0,n-1);
			//cout<<ans<<endl;
			indl[ s[i] ] ++;
			indr[ s[i] ] ++;
			fix[loc]=1;
			upd(1,0,n-1,loc);
		}
	}
	
	return ans;
}

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