1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
| #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 200005
#define put() putchar('\n')
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
using namespace std;
Tp void read(T &x){
int f=1;x=0;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
x*=f;
}
namespace Debug{
Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
int sum=1;
while (y) {
if (y&1) sum=sum*x%mod;
x=x*x%mod;y>>=1;
}
return sum;
}
int n,m;
int vis[maxn],dis[maxn];
int h[maxn],head=1;
struct yyy {
int to,z,w;
void add(int x,int y,int val) {
to=y;z=h[x];h[x]=head;w=val;
}
}a[maxn*5];
priority_queue<pair<int,int> >q;
signed main(void){
int i,x,y,z;
read(n);read(m);
memset(dis,0x3f,sizeof(dis));
for (i=1;i<=n;i++) a[++head].add(i-1,i,1),a[++head].add(i,i-1,0);
for (i=1;i<=m;i++) {
read(x),read(y),read(z);
a[++head].add(x-1,y,y-x+1-z);
}
dis[0]=0;q.push(mk(0,0));
while (!q.empty()) {
x=q.top().se;q.pop();
if (vis[x]) continue;vis[x]=1;
for (i=h[x];i;i=a[i].z)
if (dis[a[i].to]>dis[x]+a[i].w) {
dis[a[i].to]=dis[x]+a[i].w;
q.push(mk(-dis[a[i].to],a[i].to));
}
}
for (i=1;i<=n;i++) printf("%d ",1^(dis[i]-dis[i-1]));put();
return 0;
}
|