제출 #1239572

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239572		yuichiro17	Arranging Shoes (IOI19_shoes)	C++20	50 / 100	1094 ms	25864 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//brute force

struct segtree{
	int n;
	vector<int>tree;
	segtree(int n):n(n),tree(2*n,0){}
	void update(int pos,int val){
		tree[pos+=n]=val;
		for(pos/=2;pos>0;pos/=2){
			tree[pos]=tree[2*pos]+tree[2*pos^1];
		}
	}
	int sum(int l,int r){
		int ans=0;
		for(l+=n,r+=n;l<r;l/=2,r/=2){
			if(l%2){
				ans+=tree[l++];
			}
			if(r%2){
				ans+=tree[--r];
			}
		}
		return ans;
	}
};

long long count_swaps(std::vector<int> s) {
	int n=s.size()/2;
	ll ans=1e18;
	vector<int>v;
	vector<vector<int>>l1(n),r1(n);
	for(int i=2*n-1;i>=0;i--){
		if(s[i]>0){
			v.push_back(s[i]-1);
			r1[s[i]-1].push_back(i);
		}else{
			l1[-s[i]-1].push_back(i);
		}
	}
	sort(v.begin(),v.end());
	do{
		segtree seg(2*n);
		ll cnt=0;
		vector<vector<int>>l(l1),r(r1);
		for(int i=0;i<n;i++){
			int li=l[v[i]].back(),ri=r[v[i]].back();
			li+=seg.sum(li,2*n);
			ri+=seg.sum(ri,2*n);
			seg.update(l[v[i]].back(),1);
			seg.update(r[v[i]].back(),1);
			l[v[i]].pop_back();r[v[i]].pop_back();
			if(ri==2*i){
				cnt+=abs(li-2*i);
			}else cnt+=abs(li-2*i)+abs(ri-2*i-1)+(li>ri);
		}
		ans=min(ans,cnt);
	}while(next_permutation(v.begin(),v.end()));
	return ans;
}

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