#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int N=3e5+5;
int n,m;
vector<int>b[N],e[N];
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin>>n>>m;
while(m--){
int l,r,c;
cin>>l>>r>>c;
b[l].push_back(l-c);
e[r].push_back(l-c);
}
multiset<int>s;
for(int i=1;i<=n;++i){
int ret=0;
for(const int&j:b[i])s.insert(j);
if(!s.empty())ret=i-*s.begin();
cout<<ret<<' ';
for(const int&j:e[i])s.erase(s.find(j));
}
cout<<'\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |