MCPcopy Create free account
hub / github.com/algorithmzuo/algorithm-journey / main

Method main

src/class161/Code06_Tourism1.java:324–359  ·  view source on GitHub ↗
(String[] args)

Source from the content-addressed store, hash-verified

322 }
323
324 public static void main(String[] args) throws IOException {
325 BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
326 StreamTokenizer in = new StreamTokenizer(br);
327 PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
328 in.nextToken();
329 n = (int) in.nval;
330 for (int i = 1; i <= n; i++) {
331 in.nextToken();
332 arr[i] = (int) in.nval;
333 }
334 for (int i = 1, u, v; i < n; i++) {
335 in.nextToken();
336 u = (int) in.nval;
337 in.nextToken();
338 v = (int) in.nval;
339 addEdge(u, v);
340 addEdge(v, u);
341 }
342 dfs3(); // dfs3() 等同于 dfs1(1, 0),调用迭代版防止爆栈
343 dfs4(); // dfs4() 等同于 dfs2(1, 1),调用迭代版防止爆栈
344 build(1, n, 1);
345 in.nextToken();
346 m = (int) in.nval;
347 for (int i = 1, x, y, v; i <= m; i++) {
348 in.nextToken();
349 x = (int) in.nval;
350 in.nextToken();
351 y = (int) in.nval;
352 in.nextToken();
353 v = (int) in.nval;
354 out.println(compute(x, y, v));
355 }
356 out.flush();
357 out.close();
358 br.close();
359 }
360
361}

Callers

nothing calls this directly

Calls 8

addEdgeMethod · 0.95
dfs3Method · 0.95
dfs4Method · 0.95
buildMethod · 0.95
computeMethod · 0.95
printlnMethod · 0.45
flushMethod · 0.45
closeMethod · 0.45

Tested by

no test coverage detected