| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 603119 | misteg168 | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 212 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 "shoes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
long long count_swaps(std::vector<int> s) {
ll n = s.size();
map<ll, set<ll>> v;
for(int i = 0; i < n; i++){
v[-s[i]].insert(i);
}
vector<bool> pos(n, 0);
ll ans = 0, curr = 0;
for(int i = 0; i < n; i++){
if(pos[i]){
curr--;
continue;
}
ans += *(v[s[i]].begin())-i-curr-1;
if(s[i] < 0) ans++;
curr++;
pos[i] = 1;
pos[ *(v[s[i]].begin()) ] = 1;
//~ cerr << i << " " << *(v[s[i]].begin()) << " " << ans << " " << curr << "\n";
v[ s[i] ].erase( v[ s[i] ].begin());
}
return ans;
}
| # | 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... | ||||
