# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
266495 | wdjpng | Arranging Shoes (IOI19_shoes) | C++17 | 107 ms | 23672 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 <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define lint long long
using namespace std;
vector<int>T;
void update(int i, int k, int n){
i++;
for(;i <= n;i+=i&-i){
T[i]+=k;
}
}
int get(int i){
i++;
int s = 0;
for(; i>0; i-=i&-i){
s+=T[i];
}
return s;
}
int getRange(int l, int r){
return get(r) - get(l-1);
}
lint count_swaps(vector<int> s){
int n = s.size()/2;
T.resize(4*n+4);
# | 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... |