#include <bits/stdc++.h>
using namespace std;
int n,T;
vector<int> g1[300005],g2[300005];
multiset<int> s;
int main()
{
ios_base::sync_with_stdio(false);
//freopen("TEST.INP","r",stdin);
//freopen("TEST.OUT","w",stdout);
cin>>n>>T;
int l,r,x;
while(T--)
{
cin>>l>>r>>x;
g1[l].push_back(x-l);
g2[r].push_back(x-l);
}
for(int i=1;i<=n;i++)
{
for(int j=0;j<g1[i].size();j++)
s.insert(g1[i][j]);
if(s.size()==0)
cout<<0<<' ';
else
cout<<*s.rbegin()+i<<' ';
for(int j=0;j<g2[i].size();j++)
s.erase(s.find(g2[i][j]));
}
}
Compilation message
trading.cpp: In function 'int main()':
trading.cpp:23:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0;j<g1[i].size();j++)
~^~~~~~~~~~~~~
trading.cpp:29:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0;j<g2[i].size();j++)
~^~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
14328 KB |
Output is correct |
2 |
Correct |
12 ms |
14436 KB |
Output is correct |
3 |
Correct |
13 ms |
14512 KB |
Output is correct |
4 |
Correct |
13 ms |
14588 KB |
Output is correct |
5 |
Correct |
14 ms |
14752 KB |
Output is correct |
6 |
Correct |
16 ms |
14780 KB |
Output is correct |
7 |
Correct |
192 ms |
23144 KB |
Output is correct |
8 |
Correct |
223 ms |
23780 KB |
Output is correct |
9 |
Correct |
240 ms |
23908 KB |
Output is correct |
10 |
Correct |
261 ms |
24640 KB |
Output is correct |
11 |
Correct |
264 ms |
25120 KB |
Output is correct |
12 |
Correct |
345 ms |
26584 KB |
Output is correct |
13 |
Correct |
326 ms |
26584 KB |
Output is correct |
14 |
Correct |
330 ms |
26784 KB |
Output is correct |
15 |
Correct |
352 ms |
27040 KB |
Output is correct |
16 |
Correct |
395 ms |
27168 KB |
Output is correct |
17 |
Correct |
357 ms |
27552 KB |
Output is correct |
18 |
Correct |
406 ms |
30212 KB |
Output is correct |
19 |
Correct |
383 ms |
30212 KB |
Output is correct |
20 |
Correct |
437 ms |
30212 KB |
Output is correct |