# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336542 | nickmet2004 | Trading (IZhO13_trading) | C++11 | 297 ms | 13292 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>
#define ll long long
#define int long long
using namespace std;
const int N=300005;
const int M=300005;
int m,n,l,r;
ll tree[4*N+2],x,ans;
void update(int i, int a, int b, int l, int r, int x){
if(r<a || l>b) return;
if( a>=l && b<=r) {
int k=a-l+x;
if(tree[i]>k) return;
tree[i]=k;
return;
}
int mid=(a+b)/2;
if(a!=b){
update(2*i+1, a, mid, l, r, x);
update(2*i+2, mid+1,b, l , r, x);
}
}
void findmx(int i, int a, int b, int x){
if(x==a && x==b) {
ans=tree[i];
return;
}
int mid=(a+b)/2;
if(tree[i]!=0 && a!=b){
ll k=tree[i];
tree[2*i+1]=max(tree[2*i+1], k);
tree[2*i+2]=max(tree[2*i+2], k+(mid+1-a));
tree[i]=0;
}
if(x<a || x>b) return;
if(a!=b){
findmx(2*i+1, a, mid, x);
findmx(2*i+2, mid+1, b, x);
}
}
main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n>>m;
for(int i=0; i<m; i++){
cin>>l>>r>>x;
l--; r--;
update(0, 0, n-1, l, r, x);
}
for(int i=0; i<n; i++){
ans=0;
findmx(0,0,n-1,i);
cout<<ans<<" ";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |