# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
583488 | lcj | Arranging Shoes (IOI19_shoes) | C++17 | 1130 ms | 627276 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>
#define LSOne(s) ((s) & -(s))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
struct FenwickTree {
vector<ll> ft;
FenwickTree(int n) : ft(n+1) {}
ll rsq(int i) {
ll su = 0;
for (; i > 0; i -= LSOne(i)) {
su += ft[i];
}
}
ll rsq(int i, int j) {
return rsq(j)-rsq(i-1);
}
void update(int i, int dv) {
for (; i < (int)ft.size(); i += LSOne(i)) {
ft[i] += dv;
}
}
};
ll count_swaps(std::vector<int> s) {
FenwickTree ft(s.size());
map<int, int> open;
int csum = 0;
for (int i = 0; i < s.size(); i++)
{
if (open.find(-s[i]) != open.end()) {
csum += i-open[-s[i]]-1 + (s[i] < 0) - ft.rsq(open[-s[i]]+1, i+1);
ft.update(i, 1);
open.erase(-s[i]);
}
else {
open[s[i]] = i;
}
}
return csum;
}
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... |