#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ar array
#define fr first
#define sc second
#define vec vector
#define ret return
#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define int long long
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b,c;
main(){
NeedForSpeed
cin>>n>>m;
priority_queue<pair<pii, int>, vec<pair<pii, int>>, greater<pair<pii, int>> >q;
for(int i=1; i<=m; i++){
cin>>l>>r>>x;
q.push(mk(mk(l, r), x - l));
}
for(int i=1; i<=n; i++){
if(q.empty())continue;
if(q.top().fr.fr <= i && i <= q.top().fr.sc){
if(q.size() == 1){
a[i] = i + q.top().sc;
}
else{
auto t = q.top();
q.pop();
while(q.top().fr.fr <= i && i <= q.top().fr.sc && q.top().sc > t.sc){
t = q.top();
q.pop();
}
q.push(t);
a[i] = i + t.sc;
}
}
else if(q.top().fr.fr <= i){
while(!q.empty() && q.top().fr.sc < i){
q.pop();
}
if(q.empty())continue;
if(q.top().fr.fr <= i && i <= q.top().fr.sc){
if(q.size() == 1){
a[i] = i + q.top().sc;
}
else{
auto t = q.top();
q.pop();
while(q.top().fr.fr <= i && i <= q.top().fr.sc && q.top().sc > t.sc){
t = q.top();
q.pop();
}
q.push(t);
a[i] = i + t.sc;
}
}
}
}
for(int i=1; i<=n; i++){
cout<<a[i]<<" ";
}
return 0;
}
Compilation message
trading.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
34 | main(){
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
