# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
249174 | Dilshod_Imomov | 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;
long long count_swaps( vector < long long > s ) {
long long n = (long long )s.size(), ans = 0, sz = 0;
vector < long long > ids, used(n);
map < long long , vector < long long > > vc;
for ( long long i = 0; i < n; i++ ) {
vc[s[i]].push_back( i );
}
// cout << "Done 1" << endl;
for ( long long i = 0; i < n; i++ ) {
if ( used[i] ) {
continue;
}
long long l = i, r = *vc[-s[i]].begin();
// cout << "Done 2 " << l << ' ' << r << '\n';
vc[ s[i] ].erase( vc[ s[i] ].begin() );
long long rr = r;
used[r] = 1;
vc[-s[i]].erase( vc[-s[i]].begin() );
long long x = upper_bound( ids.begin(), ids.end(), i ) - ids.begin();
x = sz - x;
l += x;
x = upper_bound( ids.begin(), ids.end(), r ) - ids.begin();
x = sz - x;
r += x;
ans += r - l - 1;
if ( s[i] > 0 ) {
ans++;
}
sz++;
ids.push_back( rr );
}
return ans;
}
/*
int main() {
long long n;
cin >> n;
vector < long long > S(2 * n);
for ( long long i = 0; i < 2 * n; i++ ) {
cin >> S[i];
}
// cout << count_swaps( S );
}*/