# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
810932 | parsadox2 | Food Court (JOI21_foodcourt) | C++14 | 1054 ms | 62988 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>
#define int long long
using namespace std;
const int maxn = 25e4 + 10;
int n , m , q , k[maxn] , c[maxn] , ans[maxn];
vector <int> ask[maxn] , all[2][maxn];
struct nod{
int sum , sum_neg , suf_sum;
nod()
{
sum = 0;
sum_neg = 0;
suf_sum = 0;
}
} tree[maxn << 2];
nod Merge(nod a , nod b)
{
nod res;
res.sum_neg = a.sum_neg + b.sum_neg;
res.sum = a.sum + b.sum;
res.suf_sum = max(b.suf_sum , b.sum + a.suf_sum);
return res;
}
void Add(int ind , int val , int ty = 1 , int node = 1 , int nl = 0 , int nr = q)
{
if(nr - nl == 1)
# | 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... |