# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294550 | nandonathaniel | Fuel Station (NOI20_fuelstation) | C++14 | 949 ms | 40148 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<LL,LL> pii;
const LL MAXN=3e5+5,INF=1e18;
struct pom{
LL x,a,b;
};
pom arr[MAXN];
LL tree[4*MAXN],lazy[4*MAXN],nxt[MAXN];
bool cmp(pom p,pom q){
return p.x<q.x;
}
void updatenode(LL now,LL L,LL R,LL val){
tree[now]+=val;
lazy[now]+=val;
}
void pushdown(LL now,LL L,LL R){
LL mid=(L+R)/2;
updatenode(2*now,L,mid,lazy[now]);
updatenode(2*now+1,mid+1,R,lazy[now]);
lazy[now]=0;
}
LL query(LL now,LL L,LL R,LL x,LL y){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |