# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230369 | Alexandruabcde | Simple (info1cup19_simple) | C++14 | 436 ms | 31096 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 <iostream>
#define INF 1000000000000000
using namespace std;
constexpr int NMAX = 200005;
struct arbore
{
long long MinPar, MinImpar, MaxPar, MaxImpar;
};
arbore arb[4*NMAX];
long long lazy[4*NMAX];
int N;
void upgradez (int nod, long long val)
{
lazy[nod] += val;
if (arb[nod].MinPar != INF)
arb[nod].MinPar += val;
if (arb[nod].MinImpar != INF)
arb[nod].MinImpar += val;
if (arb[nod].MaxPar != -INF)
arb[nod].MaxPar += val;
if (arb[nod].MaxImpar != -INF)
arb[nod].MaxImpar += val;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |