# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
640188 | ymm | Arranging Shoes (IOI19_shoes) | C++17 | 1087 ms | 274588 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>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
static const int N = 100'010;
static queue<int> l[N], r[N];
static int frw[N];
__attribute__((optimize("O3,unroll-loops"),target("avx")))
static void add(int l, int r)
{
Loop (i,l,r)
frw[i] += 1;
}
long long count_swaps(std::vector<int> s) {
ll ans = 0;
Loop (i, 0, s.size()) {
int x = s[i];
if (x < 0) {
if (r[-x].size()) {
ans += i - r[-x].front() - frw[r[-x].front()];
add(r[-x].front(), i);
r[-x].pop();
} else {
l[-x].push(i);
}
} else {
if (l[x].size()) {
ans += i - l[x].front() - frw[l[x].front()]- 1;
add(l[x].front(), i);
l[x].pop();
} else {
r[x].push(i);
}
}
}
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... |