# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
620080 | serize | Arranging Shoes (IOI19_shoes) | C++17 | 48 ms | 6352 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>
#include <cstdio>
#include <cassert>
#define all(x) x.begin(),x.end()
#define lowbit(x) x&(-x)
using namespace std;
const int NMAX = 4e5+2;
vector<int> fenwick(NMAX);
inline void add(int k, int v){
if(k <= 0) return;
while(k < NMAX){
fenwick[k] += v;
k += lowbit(k);
}
}
inline int read(int k){
int sum = 0;
while(k > 0){
sum+=fenwick[k];
k -= lowbit(k);
}
return sum;
}
# | 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... |