# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
972910 | dio_2 | Synchronization (JOI13_synchronization) | C++17 | 295 ms | 30700 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>
using namespace std;
struct FenwickTree{
vector<long long> fenw;
int n;
FenwickTree () {}
FenwickTree (int siz){
init(siz);
}
void init(int siz){
n = siz;
fenw.assign(n, 0);
}
\
long long sum(int r){
long long res = 0;
while(r >= 0){
res += fenw[r];
r = (r & (r + 1)) - 1;
}
return res;
}
long long sum(int l, int r){
long long res = sum(r);
if(l) res -= sum(l - 1);
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... |