# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410794 | nichke | Cambridge (info1cup18_cambridge) | C++14 | 1 ms | 332 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;
#define int long long
#define endl '\n'
const int INF = 2e9;
int n, m;
int t[100005];
int d[100005];
int lz[400005];
int tmp[100005];
int lazy[400005];
int tree[400005];
int rmost[100005];
void push(int v, int l, int r) {
if (l > r) return;
if (lz[v] == 0) return;
tree[v] += lazy[v];
if (l != r) {
lz[2 * v] = 1;
lz[2 * v + 1] = 1;
lazy[2 * v] += lazy[v];
lazy[2 * v + 1] += lazy[v];
}
lazy[v] = 0;
lz[v] = 0;
}
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... |