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
65
66
67
68
69
70
71
72
73
74
75
76
77
| #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
int n,q;
bitset<40> a[(int)1e5+9],b[(int)1e5+9];
vector<pii> v[(int)1e5+9];
void zero(int x,int y,int val){
for(int i=0;i<30;++i){
if(!((1ll<<i)&val)){
a[x][i]=a[y][i]=1;
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>q;
for(int i=1,x,y,z;i<=q;++i){
cin>>x>>y>>z;
if(x==y){
b[x]=z;
zero(x,x,z);
continue;
}
v[x].push_back({y,z});
v[y].push_back({x,z});
zero(x,y,z);
}
for(int i=1;i<=n;++i){
for(auto [aa,bb]:v[i]){
bitset<40> tt(bb);
b[i]|=(a[aa]&tt);
}
}
for(int i=1;i<=n;++i){
for(auto [aa,bb]:v[i]){
if(i>aa){
bitset<40> tt(bb);
b[i]|=(tt^b[aa]);
}
}
}
for(int i=1;i<=n;++i){
cout<<b[i].to_ullong()<<" \n"[i==n];
}
return 0;
}
|