# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176692 | dragst | Growing Vegetables is Fun 5 (JOI24_vegetables5) | C++20 | 694 ms | 23924 KiB |
#include <bits/stdc++.h>
using namespace std;
long long n, a[600005], b[300005], c[300005], l[300005], r[300005], bit[600005], bit2[600005];
void add(long long x, long long y)
{
while (x<=2*n)
{
bit[x]+=y;
x+=(x&(-x));
};
}
long long sum(long long x)
{
long long ans=0;
while (x>0)
{
ans+=bit[x];
x-=(x&(-x));
};
return ans;
}
void add2(long long x, long long y)
{
while (x<=2*n)
{
bit2[x]+=y;
# | 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... |