# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363913 | ogibogi2004 | Cambridge (info1cup18_cambridge) | C++14 | 273 ms | 8264 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;
const int MAXN=1e5+6;
const int INF=2e9;
const int sq=300;
struct SegmentTree
{
int node[MAXN];
int lazy[MAXN];
bool lz[MAXN];
void init()
{
memset(lz,0,sizeof(lz));
memset(lazy,0,sizeof(lazy));
memset(node,0,sizeof(node));
}
int merge(int n1,int n2)
{
return max(n1,n2);
}
void push(int idx,int l,int r)
{
if(lz[idx]==0)return;
node[idx]+=lazy[idx];
if(l!=r)
{
lz[idx*2]=1;
lz[idx*2+1]=1;
lazy[idx*2]+=lazy[idx];
lazy[idx*2+1]+=lazy[idx];
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... |