#include<bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int n,m;
int a[N];
struct tr{
int l,r,x;
} tr[N];
vector<int> in[N],out[N];
signed main(){
iostream::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
cin >> n >> m;
for(int i = 0;i<m;i++){
cin >> tr[i].l >> tr[i].r >> tr[i].x;
tr[i].l--;
tr[i].r--;
in[tr[i].l].push_back(i);
out[tr[i].r].push_back(i);
}
multiset<int> se;
int c = 0;
for(int i = 0;i<n;i++){
for(auto e : in[i]){
se.insert(tr[e].x - c);
}
// for(auto e : se)cout << e << " ";
// cout << endl;
if(se.size() == 0)
a[i] = 0;
else
a[i] = *se.rbegin() + c;
c++;
for(auto e : out[i]){
int val = tr[e].x - tr[e].l;
// cerr << e << " " << val << endl;
se.erase(se.find(val));
}
}
for(int i = 0;i<n;i++)
cout << a[i] << " ";
cout << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
14420 KB |
Output is correct |
2 |
Correct |
8 ms |
14344 KB |
Output is correct |
3 |
Correct |
8 ms |
14420 KB |
Output is correct |
4 |
Correct |
8 ms |
14428 KB |
Output is correct |
5 |
Correct |
10 ms |
14516 KB |
Output is correct |
6 |
Correct |
9 ms |
14548 KB |
Output is correct |
7 |
Correct |
158 ms |
27992 KB |
Output is correct |
8 |
Correct |
213 ms |
29384 KB |
Output is correct |
9 |
Correct |
181 ms |
29628 KB |
Output is correct |
10 |
Correct |
194 ms |
30784 KB |
Output is correct |
11 |
Correct |
214 ms |
31620 KB |
Output is correct |
12 |
Correct |
231 ms |
33752 KB |
Output is correct |
13 |
Correct |
232 ms |
33032 KB |
Output is correct |
14 |
Correct |
247 ms |
34172 KB |
Output is correct |
15 |
Correct |
293 ms |
35392 KB |
Output is correct |
16 |
Correct |
310 ms |
35880 KB |
Output is correct |
17 |
Correct |
280 ms |
36184 KB |
Output is correct |
18 |
Correct |
320 ms |
39180 KB |
Output is correct |
19 |
Correct |
299 ms |
36604 KB |
Output is correct |
20 |
Correct |
344 ms |
39944 KB |
Output is correct |