# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683166 | arnold518 | Measures (CEOI22_measures) | C++17 | 314 ms | 32212 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 pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5+10;
const ll INF = 1e18;
int N, M, D;
pll A[MAXN+10];
struct SEG
{
pll tree[MAXN*4+10];
ll tree2[MAXN*4+10];
ll lazy[MAXN*4+10];
SEG()
{
fill(tree, tree+MAXN*4+10, pll(-INF, INF));
fill(tree2, tree2+MAXN*4+10, -INF);
}
void busy(int node, int tl, int tr)
{
if(!lazy[node]) return;
tree[node].first+=lazy[node]; tree[node].second+=lazy[node];
if(tl!=tr)
{
lazy[node*2]+=lazy[node];
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... |