제출 #915649

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915649		SmuggingSpun	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	483 ms	149116 KiB

shoes

#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll count_swaps(vector<int>s){
	int n = s.size();
	map<int, deque<int>>p;
	vector<int>a(n);
	for(int i = 0, index = 1; i < n; i++){
		if(!p[-s[i]].empty()){
			a[i] = p[-s[i]].front() + (s[i] < 0 ? -1 : 1);
			p[-s[i]].pop_front();
		}
		else{
			p[s[i]].push_back(a[i] = index + int(s[i] > 0));
			index += 2;
		}
	}
	vector<int>bit(n + 1, 0);
	auto update = [&] (int p){
		for(; p <= n; p += p & -p){
			bit[p]++;
		}
	};
	auto get = [&] (int p){
		int ans = 0;
		for(; p > 0; p -= p & -p){
			ans += bit[p];
		}	
		return ans;
	};
	ll ans = 0;
	for(int i = 0; i < n; i++){
		ans += i - get(a[i]);
		update(a[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