# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
212641 | Aydarov03 | Arranging Shoes (IOI19_shoes) | C++17 | 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.
/*
no pain, no gain
*/
//#pragma GCC optimize ("Ofast")
//#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define prev myrza4321
#define y1 myrza1234
#define OK puts("OK")
using namespace std;
const int N = (int)1e5 + 5;
const int INF = 0x3f3f3f3f;
int a[N];
/*
4
2 1 -1 -2
*/
main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int ans = 0;
for (int l = 0; l < n; l += 2) {
int lst = -1;
if (a[l] < 0) {
lst = l + 1;
} else {
lst = l;
}
for (int r = l + 1; r < n; r++) {
if (a[r] == -a[l]) {
int pos = r;
while (pos > lst) {
swap(a[pos], a[pos - 1]);
pos--, ans++;
}
break;
}
}
}
cout << ans;
}