# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143267 | tpoppo | Arranging Shoes (IOI19_shoes) | C++14 | 229 ms | 141008 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>
#define lsb(x) (x&(-x))
using namespace std;
const int MAXN = 2e5 + 1000;
const int OFFSET = 1e5 + 50;
using pii = pair<int,int>;
using ll = long long;
struct fenwick{
int N;
vector<ll> ft;
void init(int n){
N=n;
ft.resize(n+1);
}
void update(int pos,int delta){
for(++pos;pos<=N;pos+=lsb(pos)){
ft[pos]+=delta;
}
}
ll query(int pos){
ll ans=0;
for(++pos;pos!=0;pos-=lsb(pos)){
ans+=ft[pos];
}
return ans;
}
Compilation message (stderr)
# | 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... |