-
Notifications
You must be signed in to change notification settings - Fork 0
/
5029_Reliefgrain.cc
171 lines (142 loc) · 3.06 KB
/
5029_Reliefgrain.cc
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
/*
*
* Author : fcbruce <[email protected]>
*
* Time : Wed 23 Sep 2015 11:01:21 AM CST
*
*/
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cstdlib>
#include <algorithm>
#include <ctime>
#include <cctype>
#include <cmath>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#define sqr(x) ((x)*(x))
#ifdef _WIN32
#define lld "%I64d"
#else
#define lld "%lld"
#endif
const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3fll;
const double PI = acos(-1.0);
const double eps = 1e-10;
typedef long long LL;
typedef int itn;
const int maxn = 100007;
const int maxm = 200007;
int fir[maxn];
int u[maxm], v[maxm], nex[maxm];
int e_max;
int size[maxn], fa[maxn], son[maxn], dep[maxn], top[maxn], pos[maxn], ref[maxn];
int cp;
int col[maxn], cov[maxn];
struct tag
{
int p, v, c;
bool operator < (const tag &rhs) const
{
return p < rhs.p;
}
};
std::vector<tag> tags;
inline void add_edge(itn s, int t)
{
int e = e_max++;
u[e] = s; v[e] = t;
nex[e] = fir[u[e]]; fir[u[e]] = e;
}
void dfs(int s, int f, int d)
{
size[s] = 1;
dep[s] = d;
son[s] = -1;
fa[s] = f;
for (int e = fir[s]; ~e; e = nex[e]) if (v[e] != f)
{
dfs(v[e], s, d + 1);
size[s] += size[v[e]];
if (son[s] == -1 || size[son[s]] < size[v[e]]) son[s] = v[e];
}
}
void split(int s, int tp)
{
top[s] =tp;
pos[s] = cp++;
ref[pos[s]] = s;
if (son[s] != -1) split(son[s], tp);
for (int e = fir[s]; ~e; e = nex[e])
if (v[e] != fa[s] && v[e] != son[s]) split(v[e], v[e]);
}
inline void detect(int x, int y, int z)
{
while (top[x] != top[y])
{
if (dep[top[x]] > dep[top[y]]) std::swap(x, y);
tags.push_back({pos[top[y]], z, 1});
tags.push_back({pos[y] + 1, z, -1});
y = fa[top[y]];
}
if (dep[x] > dep[y]) std::swap(x, y);
tags.push_back({pos[x], z, 1});
tags.push_back({pos[y] + 1, z, -1});
}
int main()
{
#ifdef FCBRUCE
freopen("/home/fcbruce/code/t", "r", stdin);
#endif // FCBRUCE
int n, m;
while (scanf("%d%d", &n, &m) == 2 && (n != 0 || m != 0))
{
e_max = 0;
memset(fir, -1, sizeof fir);
for (int i = 1, u, v; i < n; i++)
{
scanf("%d%d", &u, &v);
add_edge(u, v);
add_edge(v, u);
}
cp = 0;
dfs(1, -1, 0);
split(1, 1);
tags.clear();
while (m--)
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
detect(x, y, z);
}
sort(tags.begin(), tags.end());
std::priority_queue<std::pair<int, int> > q;
memset(cov, 0, sizeof cov);
memset(col, 0, sizeof col);
for (int i = 0, j = 0; i < cp; i++)
{
while (j < tags.size() && tags[j].p <= i)
{
cov[tags[j].v] += tags[j].c;
if (cov[tags[j].v] > 0) q.push({cov[tags[j].v], -tags[j].v});
j++;
}
while (!q.empty() && col[ref[i]] == 0)
{
auto &tmp = q.top();
if (cov[-tmp.second] != tmp.first) q.pop();
else col[ref[i]] = -tmp.second;
}
}
for (int i = 1; i <= n; i++) printf("%d\n", col[i]);
}
return 0;
}