#include<stdio.h>
#include<algorithm>
#include<set>
using namespace std;
set<int>q;
int n,m;
struct data{
int l,r,x;
bool operator<(const data&r)const{
return l<r.l;
}
}a[300010];
struct data2{
int l,r,x;
bool operator<(const data2&p)const{
return r<p.r;
}
}b[300010];
int main()
{
int i,j,p1=1,p2=1;
set<int>::iterator p;
scanf("%d %d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d %d %d",&a[i].l,&a[i].r,&a[i].x);
b[i].l=a[i].l; b[i].r=a[i].r; b[i].x=a[i].x;
}
sort(a+1,a+m+1);
sort(b+1,b+m+1);
for(i=1;i<=n;i++){
for(j=p1;j<=m;j++){
if(a[j].l>i) break;
q.insert(a[j].x-a[j].l);
}
p1=j;
for(j=p2;j<=m;j++){
if(b[j].r>=i) break;
q.erase(b[j].x-b[j].l);
}
p2=j;
if(q.empty()){printf("0 "); continue;}
p=q.end(); p--;
printf("%d ",(*p)+i);
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
8248 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
8248 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
8248 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
8248 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
8248 KB |
Output isn't correct |
6 |
Correct |
0 ms |
8248 KB |
Output is correct |
7 |
Incorrect |
132 ms |
10624 KB |
Output isn't correct |
8 |
Correct |
200 ms |
10360 KB |
Output is correct |
9 |
Correct |
180 ms |
11416 KB |
Output is correct |
10 |
Incorrect |
210 ms |
13000 KB |
Output isn't correct |
11 |
Correct |
202 ms |
10360 KB |
Output is correct |
12 |
Incorrect |
243 ms |
13528 KB |
Output isn't correct |
13 |
Incorrect |
225 ms |
10624 KB |
Output isn't correct |
14 |
Incorrect |
268 ms |
12604 KB |
Output isn't correct |
15 |
Correct |
258 ms |
12208 KB |
Output is correct |
16 |
Incorrect |
286 ms |
11020 KB |
Output isn't correct |
17 |
Correct |
301 ms |
12472 KB |
Output is correct |
18 |
Incorrect |
265 ms |
14452 KB |
Output isn't correct |
19 |
Correct |
310 ms |
12340 KB |
Output is correct |
20 |
Incorrect |
349 ms |
11812 KB |
Output isn't correct |