(int u, int t)
| 124 | } |
| 125 | |
| 126 | public static void dfs2(int u, int t) { |
| 127 | top[u] = t; |
| 128 | if (son[u] == 0) { |
| 129 | return; |
| 130 | } |
| 131 | dfs2(son[u], t); |
| 132 | for (int e = head2[u], v; e > 0; e = next2[e]) { |
| 133 | v = to2[e]; |
| 134 | if (v != fa[u] && v != son[u]) { |
| 135 | dfs2(v, v); |
| 136 | } |
| 137 | } |
| 138 | } |
| 139 | |
| 140 | public static boolean mustPass(int a, int b, int c) { |
| 141 | while (top[a] != top[b]) { |