| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 530843 | M1v1savva | 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 "shoes.h"
#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define forn(i, x) for (int i = 0; i < (int)x; i++)
#define pb push_back
#define rforn(i, x) for (int i = (int)x - 1; i >= 0; i--)
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ff first
#define ss second
using namespace std;
template<class T>
void print(T a) {
for (auto x : a)
cout << x << ' ';
cout << endl;
}
//signed main() {
//freopen("test.txt", "r", stdin);
// int n;
// cin >> n;
// vector<int> a(n * 2);
// forn (i, n * 2)
// cin >> a[i];
long long count_swaps(int S[]) {
vector<int> a;
int n = size(S) / 2;
forn (i, 2 * n)
a.pb(S[i]);
map<int, int> scores;
map<int, int> prev;
long long ans = 0;
forn (i, 2 * n) {
int val = a[i];
scores[abs(val)]++;
if (scores[abs(val)] % 2 == 0) {
ans += i - prev[abs(val)];
if (val > 0)
ans--;
} else {
prev[abs(val)] = i;
}
}
return ans;
//cout << ans << '\n';
//return 0;
}