Submission #3769558
Source Code Expand
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.OutputStream; import java.io.PrintWriter; import java.io.BufferedWriter; import java.util.Collection; import java.util.InputMismatchException; import java.io.IOException; import java.util.ArrayList; import java.util.List; import java.io.Writer; import java.io.OutputStreamWriter; import java.util.Queue; import java.util.LinkedList; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); OutputWriter out = new OutputWriter(outputStream); DTransitTreePath solver = new DTransitTreePath(); solver.solve(1, in, out); out.close(); } static class DTransitTreePath { List<Edge>[] graph; long[] dist; boolean[] visited; public void solve(int testNumber, InputReader in, OutputWriter out) { int n = in.nextInt(); graph = new ArrayList[n + 1]; dist = new long[n + 1]; visited = new boolean[n + 1]; for (int i = 0; i < n + 1; i++) { graph[i] = new ArrayList<>(); } for (int i = 1; i < n; i++) { int u = in.nextInt(); int v = in.nextInt(); int w = in.nextInt(); graph[u].add(new Edge(v, w)); graph[v].add(new Edge(u, w)); } Queue<Integer> q = new LinkedList<>(); int Q = in.nextInt(); int k = in.nextInt(); q.add(k); dist[k] = 0; visited[k] = true; while (!q.isEmpty()) { int u = q.poll(); for (Edge e : graph[u]) { if (!visited[e.to]) { dist[e.to] = dist[u] + e.w; visited[e.to] = true; q.add(e.to); } } } for (int i = 0; i < Q; i++) { int u = in.nextInt(); int v = in.nextInt(); long distance = dist[u] + dist[v]; out.println(distance); } } class Edge { int to; int w; public Edge(int to, int w) { this.to = to; this.w = w; } } } static class InputReader { private InputStream stream; private byte[] buf = new byte[1024]; private int curChar; private int numChars; private InputReader.SpaceCharFilter filter; public InputReader(InputStream stream) { this.stream = stream; } public int read() { if (numChars == -1) { throw new InputMismatchException(); } if (curChar >= numChars) { curChar = 0; try { numChars = stream.read(buf); } catch (IOException e) { throw new InputMismatchException(); } if (numChars <= 0) { return -1; } } return buf[curChar++]; } public int nextInt() { int c = read(); while (isSpaceChar(c)) { c = read(); } int sgn = 1; if (c == '-') { sgn = -1; c = read(); } int res = 0; do { if (c < '0' || c > '9') { throw new InputMismatchException(); } res *= 10; res += c - '0'; c = read(); } while (!isSpaceChar(c)); return res * sgn; } public boolean isSpaceChar(int c) { if (filter != null) { return filter.isSpaceChar(c); } return isWhitespace(c); } public static boolean isWhitespace(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } public interface SpaceCharFilter { public boolean isSpaceChar(int ch); } } static class OutputWriter { private final PrintWriter writer; public OutputWriter(OutputStream outputStream) { writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream))); } public OutputWriter(Writer writer) { this.writer = new PrintWriter(writer); } public void close() { writer.close(); } public void println(long i) { writer.println(i); } } }
Submission Info
Submission Time | |
---|---|
Task | D - Transit Tree Path |
User | rogernadal |
Language | Java8 (OpenJDK 1.8.0) |
Score | 400 |
Code Size | 5164 Byte |
Status | AC |
Exec Time | 446 ms |
Memory | 63092 KB |
Compile Error
Note: ./Main.java uses unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details.
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 77 ms | 17876 KB |
sample_02.txt | AC | 78 ms | 20692 KB |
sample_03.txt | AC | 76 ms | 21460 KB |
subtask_1_1.txt | AC | 79 ms | 20692 KB |
subtask_1_10.txt | AC | 151 ms | 24664 KB |
subtask_1_11.txt | AC | 82 ms | 19412 KB |
subtask_1_12.txt | AC | 103 ms | 21972 KB |
subtask_1_13.txt | AC | 127 ms | 25412 KB |
subtask_1_14.txt | AC | 76 ms | 19796 KB |
subtask_1_15.txt | AC | 97 ms | 20308 KB |
subtask_1_16.txt | AC | 304 ms | 52880 KB |
subtask_1_17.txt | AC | 310 ms | 52624 KB |
subtask_1_18.txt | AC | 309 ms | 52164 KB |
subtask_1_19.txt | AC | 446 ms | 63092 KB |
subtask_1_2.txt | AC | 101 ms | 19028 KB |
subtask_1_20.txt | AC | 304 ms | 53544 KB |
subtask_1_21.txt | AC | 378 ms | 57044 KB |
subtask_1_22.txt | AC | 338 ms | 56544 KB |
subtask_1_23.txt | AC | 324 ms | 53204 KB |
subtask_1_24.txt | AC | 355 ms | 57588 KB |
subtask_1_25.txt | AC | 337 ms | 57076 KB |
subtask_1_26.txt | AC | 352 ms | 60336 KB |
subtask_1_27.txt | AC | 293 ms | 55648 KB |
subtask_1_28.txt | AC | 275 ms | 55184 KB |
subtask_1_3.txt | AC | 278 ms | 50704 KB |
subtask_1_4.txt | AC | 78 ms | 19540 KB |
subtask_1_5.txt | AC | 180 ms | 31244 KB |
subtask_1_6.txt | AC | 133 ms | 21972 KB |
subtask_1_7.txt | AC | 173 ms | 25320 KB |
subtask_1_8.txt | AC | 77 ms | 19412 KB |
subtask_1_9.txt | AC | 258 ms | 53324 KB |