# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
391998 | AugustinasJucas | Arranging Shoes (IOI19_shoes) | C++14 | 4 ms | 4996 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;
const int dydis = 1e5 + 1;
vector<int> kurL[dydis];
vector<int> kurR[dydis];
long long count_swaps(vector<int> s) {
for(int i = 0; i < s.size(); i++){
if(s[i] > 0) kurR[s[i]].push_back(i);
else kurL[-s[i]].push_back(i);
}
vector<pair<int, int> > poros;
int n = s.size()/2;
for(int i = 1; i <= n; i++){
for(int j = 0; j < kurL[i].size(); j++){
if(kurL[i][j] < kurR[i][j]){
poros.push_back({kurL[i][j], kurR[i][j]-1});
}else{
poros.push_back({kurR[i][j], kurL[i][j]});
}
}
}
sort(poros.begin(), poros.end());
reverse(poros.begin(), poros.end());
int realIndex[s.size() + 1];
for(int i = 0; i < s.size(); i++) realIndex[i] = i;
int ans = 0;
for(auto x : poros){
int i1 = realIndex[x.first];
int i2 = realIndex[x.second];
ans += i2-i1;
for(int i = i1+1; i < i2; i++){
realIndex[i]--;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |