제출 #297891

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297891		erd1	Arranging Shoes (IOI19_shoes)	C++14	30 / 100	262 ms	15736 KiB

shoes

#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef int64_t lld;
typedef pair<int, int> pii;

#include<bits/extc++.h>
using namespace __gnu_pbds;
template<typename T, typename comp = less<T>>
using OST = tree<T, null_type, comp, rb_tree_tag, tree_order_statistics_node_update>;

template<typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> p){
	return out << "(" << p.ff << ", " << p.ss << ")";
}

map<int, int> cnt;

struct comp{
	bool operator()(const pii& a, const pii& b) const {
		if(abs(a.ff) != abs(b.ff))return abs(a.ff) < abs(b.ff);
		if(a.ss != b.ss)return a.ss < b.ss;
		return a.ff < b.ff;
	}
};

OST<pii, comp> ost;

long long count_swaps(vector<int> s) {
	lld ans = 0;
	for(auto i: s)ans += ost.size()-ost.order_of_key({i, cnt[i]}), ost.insert({i, cnt[i]++});
	return ans;
}

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