#include<bits/stdc++.h>
#define el '\n'
using namespace std ;
int32_t main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n , m;
cin >> n >> m;
vector<vector<pair<int , int>>> lt(n + 5) , rt(n + 5);
for ( int i = 1 ; i <= m ; i++ ){
int l , r , x;
cin >> l >> r >> x;
lt[l].push_back(make_pair(r , x));
rt[r].push_back(make_pair(l , x));
}
multiset<int> store;
for ( int i = 1 ; i <= n ; i++ ){
for ( auto x : lt[i] ) store.insert(x.second - i);
if (store.empty()) cout << 0 << " ";
else cout << i + *store.rbegin() << " ";
for ( auto x : rt[i] ) store.erase(store.find(x.second - x.first));
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
604 KB |
Output is correct |
6 |
Correct |
2 ms |
604 KB |
Output is correct |
7 |
Correct |
113 ms |
19432 KB |
Output is correct |
8 |
Correct |
111 ms |
21152 KB |
Output is correct |
9 |
Correct |
116 ms |
21952 KB |
Output is correct |
10 |
Correct |
134 ms |
23856 KB |
Output is correct |
11 |
Correct |
134 ms |
24964 KB |
Output is correct |
12 |
Correct |
162 ms |
27468 KB |
Output is correct |
13 |
Correct |
148 ms |
27192 KB |
Output is correct |
14 |
Correct |
177 ms |
28808 KB |
Output is correct |
15 |
Correct |
172 ms |
30276 KB |
Output is correct |
16 |
Correct |
198 ms |
30772 KB |
Output is correct |
17 |
Correct |
183 ms |
31516 KB |
Output is correct |
18 |
Correct |
237 ms |
34904 KB |
Output is correct |
19 |
Correct |
180 ms |
32628 KB |
Output is correct |
20 |
Correct |
253 ms |
36556 KB |
Output is correct |