# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45122 | model_code | Cambridge (info1cup18_cambridge) | C++17 | 984 ms | 234444 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 <cstdio>
#include <cassert>
#include <algorithm>
using namespace std;
int n, q, t[100010], d[100010], leftt[100010];
struct arbint
{
int ap;
long long dif, lazy;
arbint *le, *ri;
arbint ()
{
ap = 0;
dif = 2000000000000000LL;
lazy = 0LL;
le = ri = NULL;
}
} *root, *nul;
void propag (arbint *node, int a, int b)
{
node->dif += node->lazy;
if (a != b)
{
# | 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... |