제출 #808754

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
808754		KemalK	Arranging Shoes (IOI19_shoes)	C++17	100 / 100	570 ms	37556 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#include "ext/pb_ds/assoc_container.hpp"
using namespace std;
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
typedef long long int ll;
int n;
long long count_swaps(std::vector<int> s) {
	int n = s.size();
	ordered_set <pair<int, int>> st;
	ll ans = 0;
	map <int, vector <int>> pos_right;
	map <int, vector <int>> pos_left;
	for (int i = n - 1; i >= 0; i--)
	{
		st.insert({i, s[i]});
		if (s[i] > 0) 
			pos_right[s[i]].push_back(i);
		else 
			pos_left[s[i]].push_back(i);
	}
	while(!st.empty()){
		pair<int, int> nd = *st.begin();
		int value = nd.second;
		pair<int, int> find_element;
		if (value > 0){
			// right
			pos_right[value].pop_back();
			find_element = {pos_left[-value].back(), -value};
			pos_left[-value].pop_back();
		}
		else{
			// left
			pos_left[value].pop_back();
			find_element = {pos_right[-value].back(), -value};
			pos_right[-value].pop_back();
		}
		ans += st.order_of_key(find_element) - 1;
		if (value > 0){
			ans++;
		}
		st.erase(st.begin());
		st.erase(find_element);
	}
	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