# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397437 | phathnv | Food Court (JOI21_foodcourt) | C++11 | 888 ms | 45220 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;
typedef long long ll;
const int N = 25e4 + 7;
struct Query{
int t, l, r, c;
ll k;
};
struct Node{
ll val;
Node *Left, *Right;
Node(ll _val){
val = _val;
Left = Right = nullptr;
}
};
struct BIT{
ll d[N];
void update(int x, int val){
for(; x < N; x += x & -x)
d[x] += val;
}
ll get(int x){
ll res = 0;
for(; x > 0; x -= x & -x)
# | 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... |