# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1140479 | tsengang | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ertunt return
#define vodka void
#include "shoes.h"
long long count_swaps(vector<int> s) {
n = s.size()/2;
if(n == 1){
if(s[0] < 0)ertunt 0;
else ertunt 1;
}
vector<ll> adj[n+4][2];
map<ll,ll>m;
for(ll i = 0; i < s.size(); i++){
m[abs(s[i])] = 1;
if(s[i] < 0){
adj[abs(s[i])][0].pb(i);
}
else adj[s[i]][1].pb(i);
}
ll cnt = 0;
ll k = -1;
ll ans = 0;
for(auto x : m){
cnt++;
k = x;
for(ll i = 0; i < adj[x][0]; i++){
if(adj[x][0][i] > adj[x][1][i]){
ans+=adj[x][0][i] - adj[x][1][i] - 1;
}
else{
ans+=adj[x][1][i] - adj[x][0][i] - 2;
}
}
}
if(cnt == 0){
ertunt ans;
}
}