# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1141241 | altern23 | Arranging Shoes (IOI19_shoes) | C++20 | 40 ms | 13740 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
struct fenwick{
ll n;
vector<ll>bit;
fenwick(ll _n = 0) : n(_n), bit(n + 5) {}
void upd(ll idx, ll val){
idx++;
for(int i = idx; i <= n; i += i & -i) bit[i] += val;
}
ll get(ll idx){
idx++;
ll ans = 0;
for(int i = idx; i >= 1; i -= i & -i) ans += bit[i];
return ans;
}
ll query(ll l, ll r){
if(l > r) return 0;
return get(r) - get(l - 1);
}
};
long long count_swaps(vector<int> s) {
# | 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... |