# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166497 | Akashi | Two Dishes (JOI19_dishes) | C++14 | 738 ms | 61688 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;
const int SZ = 1e6 + 5;
const long long INF = 1e18;
int n, m;
long long Arb[4000015], Lazy_scad[4000015], Lazy_max[4000015];
long long a[SZ], b[SZ], s[SZ], s1[SZ], s2[SZ], t[SZ], q[SZ], p[SZ];
void propag_scad(int nod){
if(Lazy_scad[nod] != 0){
Arb[nod * 2] += Lazy_scad[nod];
Arb[nod * 2 + 1] += Lazy_scad[nod];
Lazy_scad[nod * 2] += Lazy_scad[nod];
Lazy_scad[nod * 2 + 1] += Lazy_scad[nod];
Lazy_scad[nod] = 0;
}
}
void propag_max(int nod){
if(Lazy_max[nod] != -INF){
Arb[nod * 2] = max(Arb[nod * 2], Lazy_max[nod]);
Arb[nod * 2 + 1] = max(Arb[nod * 2 + 1], Lazy_max[nod]);
Lazy_max[nod * 2] = max(Lazy_max[nod * 2], Lazy_max[nod]);
Lazy_max[nod * 2 + 1] = max(Lazy_max[nod * 2 + 1], Lazy_max[nod]);
Lazy_max[nod] = -INF;
}
}
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... |