# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832203 | devariaota | 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.
#include<bits/stdc++.h>
using namespace std;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define tup tuple<int, int, int>
#define pii pair<int, int>
#define fi first
#define se second
#define pub push_back
#define pob pop_back
int n;
vector<int> s;
int main() {
ioss;
cin >> n;
for(int i = 0; i < 2*n; i++) {
int a; cin >> a;
s.pub(a);
}
int ans = 0;
for(int i = 0; i < 2*n; i++) {
if(s[i] == 0) continue;
if(s[i] < 0) {
int cnt = 0;
for(int j = i+1; j < 2*n; j++) {
if(s[j] == 0) {
cnt++;
continue;
}
if(s[j] == -s[i]) {
ans += j-i-1 - cnt;
s[i] = s[j] = 0;
break;
}
}
}
else {
int cnt = 0;
for(int j = i+1; j < 2*n; j++) {
if(s[j] == 0) {
cnt++;
continue;
}
if(s[j] == -s[i]) {
ans += j-i - cnt;
s[i] = s[j] = 0;
break;
}
}
}
}
cout << ans << endl;
}