# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
736302 | LCJLY | Foehn Phenomena (JOI17_foehn_phenomena) | C++14 | 1057 ms | 66628 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
typedef pair<int,int>pii;
inline int combine(int a, int b){
return a+b;
}
const int defval=0;
#define lazyChange (e-s+1)
struct node{
int s,e,m;
node *l, *r;
int v;
int lazyUpd, lazySet;
node(int ss, int ee):s(ss),e(ee),m((s+e)>>1),v(defval),lazyUpd(0){
if(s!=e){
l=new node(s,m); r=new node(m+1,e);
}
}
inline int forceProp(){
if(s==e){
v+=lazyUpd; lazyUpd=0; return v;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |