# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1170562 | wii | Arranging Shoes (IOI19_shoes) | C++20 | 1 ms | 2632 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i = (a); i <= (b); ++i)
#define ford(i,a,b) for(int i = (a); i >= (b); --i)
const int MaxN = 1e5 + 5;
vector<int> pos[MaxN];
int l[MaxN];
int f[MaxN];
void upd(int u, int x) {
for (; u < MaxN; u += u & -u)
f[u] += x;
}
int get(int u) {
int ans = 0;
for (; u > 0; u -= u & -u)
ans += f[u];
return ans;
}
int get(int l, int r) {
return get(r) - get(l - 1);
}
long long count_swaps(std::vector<int> s) {
int n = s.size();
# | 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... |