Submission #230369

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
2303692020-05-09 18:51:06AlexandruabcdeSimple (info1cup19_simple)C++14
100 / 100
436 ms31096 KiB
#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;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...