/** * * * * * * * * * * * * * **\
* *
* Author: Haidara Nassour *
* Coded in: YYYY\M\D HH:MM:SS *
* Lang: C++ *
* *
\** * * * * * * * * * * * * * **/
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//#define int long long
#define itn int
#define rep(i,x,n) for(int i=(x);i<(n);i++)
#define FOR(i,n) rep(i,0,n)
#define per(i,x,n) for(int i=(x);i>(n);i--)
#define ROF(i,x) for(int i=x;i>=0;i--)
#define v(i) vector< i >
#define p(i,j) pair< i , j >
#define pii pair<int,int>
#define m(i,j) map< i , j >
#define um(i,j) unordered_map< i , j >
#define max_heap(i) priority_queue< i >
#define min_heap(i) priority_queue< i , vector< i > ,greater< i > >
#define ff first
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ss second
#define pp push_back
#define mini(x,y) x=min(x,y)
#define maxi(x,y) x=max(x,y)
#define debug(x) cout<<#x<<" ";
using namespace std;
const int inf=1LL<<62LL;
const int mod=1e9+7;
const int maxn=200200;
int n;
struct node
{
int min=inf,max=0,lazy=0,val=0;
node():min(inf),max(0),val(0),lazy(0){}
}st[maxn*4];
void pup(int inx)
{
st[inx].min=min(st[inx*2].min,st[inx*2+1].min);
st[inx].max=max(st[inx*2].max,st[inx*2+1].max);
}
void pull(int inx,int l,int r)
{
st[inx].val+=st[inx].lazy;
st[inx].val=min(st[inx].val,st[inx].max);
st[inx].val=max(st[inx].val,st[inx].min);
if(l!=r)
{
st[inx*2].lazy+=st[inx].lazy;
st[inx*2+1].lazy+=st[inx].lazy;
}
st[inx].lazy=0;
}
void build(v(int)a,int l=1,int r=n,int inx=1)
{
if(l==r)
{
st[inx].min=a[l-1];
st[inx].max=a[l-1];
return ;
}
int mid=l+(r-l)/2;
build(a,l,mid,inx*2);
build(a,mid+1,r,inx*2+1);
pup(inx);
}
void update(int ul,int ur,int val,int l=1,int r=n,int inx=1)
{
pull(inx,l,r);
if(ul<=l&&r<=ur)
{
st[inx].lazy+=val;
pull(inx,l,r);
return ;
}
if(l>ur||ul>r)
return ;
int mid=l+(r-l)/2;
update(ul,ur,val,l,mid,inx*2);
update(ul,ur,val,mid+1,r,inx*2+1);
pup(inx);
}
int query(int pos,int l=1,int r=n,int inx=1)
{
pull(inx,l,r);
if(l==r)
return st[inx].val;
int mid=l+(r-l)/2;
if(pos<=mid)
return query(pos,l,mid,inx*2);
return query(pos,mid+1,r,inx*2+1);
}
vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V)
{
build(C);
n=C.size();
FOR(i,(int)L.size())
update(L[i]+1,R[i]+1,V[i]);
v(int)ans(n);
FOR(i,n)
ans[i]=query(i+1);
return ans;
}
Compilation message
candies.cpp:32:18: warning: overflow in conversion from 'long long int' to 'int' changes value from '4611686018427387904' to '0' [-Woverflow]
32 | const int inf=1LL<<62LL;
| ~~~^~~~~~
candies.cpp: In constructor 'node::node()':
candies.cpp:38:30: warning: 'node::val' will be initialized after [-Wreorder]
38 | int min=inf,max=0,lazy=0,val=0;
| ^~~
candies.cpp:38:23: warning: 'int node::lazy' [-Wreorder]
38 | int min=inf,max=0,lazy=0,val=0;
| ^~~~
candies.cpp:39:5: warning: when initialized here [-Wreorder]
39 | node():min(inf),max(0),val(0),lazy(0){}
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
16 ms |
25804 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
132 ms |
75156 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
20 ms |
25888 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
17 ms |
25760 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
16 ms |
25804 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
