# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
547878 | quocnguyen1012 | Food Court (JOI21_foodcourt) | C++14 | 454 ms | 51748 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;
template<class T>struct fenwick {
vector<T> bit;
fenwick(int n) {
bit.assign(n + 5, 0);
}
void add(int i, T delta) {
for (; i < (int)bit.size(); i += i & -i)
bit[i] += delta;
}
T query(int i) {
T ans = 0;
for (; i; i -= i & -i) {
ans += bit[i];
}
return ans;
}
};
template<class T>class lazy_segtree {
private:
vector<T> st, lz;
int n;
#define lc id << 1
#define rc id << 1 | 1
void push(int id, int l, int r) {
st[id] += lz[id];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |