# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
684105 | Dulguun | Arranging Shoes (IOI19_shoes) | C++14 | 1 ms | 340 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<int> s){
map<int, vector<int> > m;
int l=s.size(), n=(s.size()+1)/2;
long long sum=0;
for(int i=0; i<l; i++){
m[s[i]].push_back(i);
}
for(int i=0; i<l; i++){
if(s[i]==0) continue;
sum+=m[-s[i]][0]-i-1;
if(s[i]>0) sum++;
s[m[-s[i]][0]]=0;
m[-s[i]].erase(m[-s[i]].begin());
}
return sum;
}
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... |