제출 #483673

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

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
typedef vector<int>vi; 
typedef string str;

#define pb push_back
#define sz(v) (int)v.size()

#define FOR(i,a,b) for(int i=a; i<b; i++)
//-------------------------------------------------


const int MX=1e5+10;
vi t(MX,0);	

void upd(int i){ i++;
	for(;i<MX; i+=i&-i) t[i]++;
}

int get(int i){ i++;
	int ans=0;
	for(;i;i-=i&-i) ans+=t[i];
	return ans; 
}

ll count_swaps(vi s) {
	int N=sz(s);
	deque<int> neg[N+1],pos[N+1],p(N);
	FOR(i,0,N){
		if(s[i]<0){	
			if(sz(pos[-s[i]])){
				p[i]=pos[-s[i]][0];
				p[p[i]]=i;
				pos[-s[i]].pop_front();
			}
			else neg[-s[i]].pb(i);
		}else{
			if(sz(neg[s[i]])){
				p[i]=neg[s[i]][0];
				p[p[i]]=i;
				neg[s[i]].pop_front();
			}
			else pos[s[i]].pb(i);
		}
	}

	vi done(N,0);
	ll ans=0;
	FOR(i,0,N) if(!done[i]){
		int j=p[i];
		ans+=(j-i-1)-(get(j)-get(i))+(s[i]>0);
		upd(j);

		done[j]=1;
	}
	return ans; 
}

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