# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1175086 | bangan | Arranging Shoes (IOI19_shoes) | C++20 | 52 ms | 20652 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pb push_back
long long count_swaps(std::vector<int> s) {
#define int long long
int n = (int)s.size();
vector<vector<int>> pos(n + 1), neg(n + 1);
for (int i = n - 1; i >= 0; i--) {
if (s[i] < 0) {
neg[-s[i]].pb(i);
}
else {
pos[s[i]].pb(i);
}
}
vector<int> fen(2 * n);
auto update = [&](int i, int v) {
for (++i ; i < 2 * n; i += i & -i) {
fen[i] += v;
}
};
auto sum = [&](int i) {
int ret = 0;
# | 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... |