# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637333 | tvladm2009 | Cambridge (info1cup18_cambridge) | C++14 | 415 ms | 130508 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;
typedef long long ll;
typedef long double ld;
const int MAX_N = 1e5;
const int lim = 1e9;
const ll INF = (1LL << 60);
int t[MAX_N + 1], d[MAX_N + 1];
int minLeft[MAX_N + 1];
int n, q;
struct Node {
Node *lson;
Node *rson;
ll lazy;
ll minVal;
int cnt;
Node() {
lson = NULL;
rson = NULL;
lazy = 0;
minVal = INF;
cnt = 0;
}
# | 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... |