# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1047358 | vjudge1 | 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.
#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define endl "\n"
#define all(x) x.begin(), x.end()
#define int long long
#define ii pair<long long,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define mid (l+r)/2
#define inf 1e15
#define MOD 1000000007
#define MX 300005
using namespace std;
int count_swaps(vi S){
int n=S.size()/2;
int arr[2*n+1];
for(int i=0; i<2*n; i++) arr[i+1]=S[i];
map<int, vi> heh;
for(int i=1; i<=2*n; i++){
heh[arr[i]].pb(i);
}
queue<int> cnt[2*n+1];
int wow=0;
set<int> s;
for(int i=1; i<=2*n; i++){
if(cnt[n-arr[i]].size()){
wow+=s.size()-distance(s.begin(), s.upper_bound(cnt[n-arr[i]].front()));
s.erase(cnt[n-arr[i]].front());
cnt[n-arr[i]].pop();
continue;
}
s.insert(i);
cnt[n+arr[i]].push(i);
}
int ans=0;
for(auto p:heh){
if(p.st>=0) break;
for(int i=0; i<p.nd.size(); i++){
ans+=abs(heh[-p.st][i] - p.nd[i]) - 1;
if(heh[-p.st][i]<p.nd[i]) ans++;
}
}
return ans-wow;
}
/*signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);
#ifdef Local
freopen("in","r",stdin);
freopen("out","w",stdout);
#endif
/*freopen("nondec.in","r",stdin);
freopen("nondec.out","w",stdout);*
int t=1;
//cin >> t;
//while(t--) solve();
int n; cin >> n;
vi nop(2*n;
for(int i=0; i<2*n; i++) cin >> nop[i];
cout << count_swaps(nop) << endl;
}*/