Submission #341252

#	Time	Username	Problem	Language	Result	Execution time	Memory
341252		YJU	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	281 ms	274168 KiB

shoes

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e5;
const ll K=350;
const ld pi=acos(-1);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
 
ll bit[N+5];
queue<ll> m[2*N+5];
 
void ins(ll id,ll del){
	++id;
	for(;id<N+5;id+=(id&-id)){
		bit[id]+=del;
	}
}
 
ll q(ll id){
	++id;
	ll sum=0;
	for(;id;id-=(id&-id)){
		sum+=bit[id];
	}
	return sum;
}
 
long long count_swaps(vector<int> s){
	long long ans=0;
	ll n=N;
	REP(i,SZ(s)){
		if(SZ(m[-s[i]+n])){
			ans-=(q(i-1)-q(m[-s[i]+n].front()));
			ans+=i-m[-s[i]+n].front()-1+(s[i]<0?1:0);
			ins(m[-s[i]+n].front(),-1);
			m[-s[i]+n].pop();
		}else{
			ins(i,1);
			m[s[i]+n].push(i);
		}
	}
	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