# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435938 | dqhungdl | Distributing Candies (IOI21_candies) | C++17 | 4608 ms | 34896 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 "candies.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<long long,long long> ii;
const int MAX=200005;
const long long INF=1e18;
int n,m;
long long Pmin[4*MAX],Pmax[4*MAX],lazy[4*MAX];
vector<ii> events[MAX];
void down(int k) {
Pmin[2*k]+=lazy[k],Pmin[2*k+1]+=lazy[k];
Pmax[2*k]+=lazy[k],Pmax[2*k+1]+=lazy[k];
lazy[2*k]+=lazy[k],lazy[2*k+1]+=lazy[k];
lazy[k]=0;
}
void update(int k,int l,int r,int L,int R,int val) {
if(l>R||L>r)
return;
if(L<=l&&r<=R) {
Pmin[k]+=val;
Pmax[k]+=val;
lazy[k]+=val;
return;
}
down(k);
int mid=(l+r)/2;
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... |