(int x, int y)
| 178 | } |
| 179 | |
| 180 | public static int nearest(int x, int y) { |
| 181 | if (isAncestor(y, x)) { |
| 182 | return kthAncestor(x, dep[x] - dep[y] - 1); |
| 183 | } else { |
| 184 | return stjump[y][0]; |
| 185 | } |
| 186 | } |
| 187 | |
| 188 | public static void pathSet(int x, int y, int prisoner) { |
| 189 | if (dep[x] < dep[y]) { |
no test coverage detected