# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
826771 | kevinsogo | Arranging Shoes (IOI19_shoes) | C++17 | 738 ms | 16216 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;
#include "shoes.h"
using ll = long long;
struct Fen {
vector<int> c;
Fen(int n): c(n + 1) {}
void inc(int i, int v = 1) {
for (++i; i < c.size(); i += i & -i) c[i] += v;
}
int sum(int i, int v = 0) {
for (; i; i -= i & -i) v += c[i];
return v;
}
};
ll count_swaps(vector<int> _seq) {
vector<int> found(_seq.size() * 2 + 5);
vector<ll> seq;
for (int v : _seq) seq.push_back(ll(v) * _seq.size() + ((v > 0) - (v < 0)) * found[v + _seq.size()]++);
unordered_map<ll,int> pos; pos.max_load_factor(0.5);
for (int i = 0; i < seq.size(); i++) pos[seq[i]] = i;
sort(seq.rbegin(), seq.rend(), [&](ll i, ll j) {
int d = min(pos[i], pos[-i]) - min(pos[j], pos[-j]);
return d ? d < 0 : i < j;
});
for (ll& v : seq) v = pos[v];
ll ans = 0;
Fen f(seq.size());
for (ll v : seq) ans += f.sum(v), f.inc(v);
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... |