| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 540473 | beaconmc | Arranging Shoes (IOI19_shoes) | C++14 | 336 ms | 145484 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>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
using namespace std;
long long count_swaps(vector<int> s) {
ll n = s.size();
unordered_map<ll, queue<ll>> susmap;
FOR(i,0,n){
susmap[s[i]].push(i);
}
ll cur = 0;
ll ans = 0;
FOR(i,0,n){
if (susmap[s[i]].size() == 0 || susmap[s[i]].front() != i){
continue;
}
if (s[i] > 0){
ans += abs(i*2 - susmap[-1*s[i]].front());
}else{
ans += abs(i*2+1 - susmap[-1*s[i]].front());
}
susmap[-1*s[i]].pop();
susmap[s[i]].pop();
}
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... | ||||
