제출 #1313946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313946		khfares	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	0 ms	332 KiB

shoes

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

long long count_swaps(std::vector<int> s) {
	map<ll, vector<ll>> mp;
	for (ll i = 0; i < s.size(); i++) {
		mp[s[i]].push_back(i);
	}
	set<ll> st;
	ll ans = 0;
	for (auto c : mp) {
		if (st.count(c.first)) continue;
		for (ll i = 0; i < c.second.size(); i++) {
			ll curr = abs(c.second[i]-mp[-c.first][i])-1;
			if ((c.first < -c.first && c.second[i] > mp[-c.first][i]) || (c.first > -c.first && c.second[i] < mp[-c.first][i])) curr++;
			ans += curr;
		}
		st.insert(c.first);
		st.insert(-c.first);
	}
	return ans;
}

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