# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835288 | VMaksimoski008 | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int64_t count_swaps(vector<int> S) {
int n = sz(S) / 2;
set<int> diff;
for(int &x : S) diff.insert(abs(x));
if(n == 1) {
if(S[0] > 0) return 1;
return 0;
}
if(diff.size() == 1) {
ll ans = 0;
int curr = 0;
for(int i=0; i<sz(S); i++) {
if(S[i] < 0) {
ans += 1ll * abs(i - curr);
curr += 2;
}
}
return ans;
}
return 0;
}
int32_t main() {
setIO();
int n;
cin >> n;
vector<int> v(2*n);
for(int &x : v) cin >> x;
cout << count_swaps(v) << '\n';
return 0;
}