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
| #include <iostream> #include <vector> using i64 = long long; using namespace std;
const int maxn = 1e7 + 1e6; const int maxn2 = 1e5 + 5; const int maxz = 1e5;
vector<int> e[maxn2];
struct node { int id, mx; node operator + (node nod) { if(mx < nod.mx) { return nod; } else { return (*this); } } }nod[maxn];
int ls[maxn], rs[maxn], ans[maxn2], cnt, fa[maxn2][20], dep[maxn2], n;
void pushdown(int u) { if(!ls[u]){ ls[u] = ++cnt; } if(!rs[u]) { rs[u] = ++ cnt; } }
void pushup(int u) { nod[u] = nod[ls[u]] + nod[rs[u]]; }
void update(int x, int l, int r, int u, int k) { if(l == r) { nod[u] = (node){x, nod[u].mx + k}; if(nod[u].mx <= 0) { nod[u].id = 0; } return; } pushdown(u); int mid = (l + r) / 2; if(x <= mid) { update(x, l, mid, ls[u], k); } else { update(x, mid + 1, r, rs[u], k); } pushup(u); }
int query(int u) { return nod[u].id; }
int merge(int u, int v, int l, int r) { if(!u || !v) { return u + v; } if(l == r) { nod[u].mx += nod[v].mx; nod[u].id = max(nod[u].id, nod[v].id); if(nod[u].mx == 0) nod[u].id = 0; return u; } int mid = (l + r) / 2; ls[u] = merge(ls[u], ls[v], l, mid); rs[u] = merge(rs[u], rs[v], mid + 1, r); pushup(u); return u; }
void add(int u, int v) { e[u].push_back(v); e[v].push_back(u); }
void dfs1(int u, int f) { fa[u][0] = f; dep[u] = dep[f] + 1; for(auto v : e[u]) { if(v == f) continue; dfs1(v, u); } }
void init() { for(int i = 1; i < 20; i++) { for(int u = 1; u <= n; u++) { fa[u][i] = fa[fa[u][i - 1]][i - 1]; } } }
int lca(int u, int v) { if(dep[u] < dep[v]) { swap(u, v); } for(int i = 19; i >= 0; i--) { if(dep[fa[u][i]] >= dep[v]) u = fa[u][i]; } if(u == v) { return u; } for(int i = 19; i >= 0; i--) { if(fa[u][i] != fa[v][i]) { u = fa[u][i]; v = fa[v][i]; } } return fa[u][0]; }
void dfs2(int u, int f) { for(auto v : e[u]) { if(v == f) continue; dfs2(v, u); merge(u, v, 1, maxz);
} ans[u] = nod[u].id; }
int main() { int m; cin >> n >> m; cnt = n; for(int i = 1; i < n; i++) { int u, v; cin >> u >> v; add(u, v); } dfs1(1, 0); init(); while(m--) { int x, y, z; cin >> x >> y >> z; update(z, 1, maxz, x, 1); update(z, 1, maxz, y, 1); update(z, 1, maxz, lca(x, y), -1); update(z, 1, maxz, fa[lca(x, y)][0], -1); } dfs2(1, 0); for(int i = 1; i <= n; i++) { cout << ans[i] << endl; } return 0; }
|