結果
問題 | No.1817 Reversed Edges |
ユーザー | tenten |
提出日時 | 2023-03-28 09:01:20 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,893 bytes |
コンパイル時間 | 3,805 ms |
コンパイル使用メモリ | 96,080 KB |
実行使用メモリ | 94,028 KB |
最終ジャッジ日時 | 2024-09-20 00:28:02 |
合計ジャッジ時間 | 15,552 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
50,436 KB |
testcase_01 | AC | 57 ms
50,880 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 59 ms
50,500 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 415 ms
75,636 KB |
testcase_23 | AC | 437 ms
75,620 KB |
testcase_24 | AC | 430 ms
94,028 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static int n; static ArrayList<ArrayList<Integer>> graph = new ArrayList<>(); static int[] counts; static int[] reverses; static int[] ans; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); for (int i = 0; i < n; i++) { graph.add(new ArrayList<>()); } for (int i = 0; i < n - 1; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; graph.get(a).add(b); graph.get(b).add(a); } counts = new int[n]; reverses = new int[n]; getCount(0, 0); ans = new int[n]; setAns(0, 0, 0); System.out.println(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new))); } static int getCount(int idx, int p) { counts[idx] = 1; for (int x : graph.get(idx)) { if (x == p) { continue; } if (x < idx) { reverses[idx]++; } counts[idx] += getCount(x, idx); reverses[idx] += reverses[x]; } return counts[idx]; } static void setAns(int idx, int p, int r) { ans[idx] = r + reverses[idx]; for (int x : graph.get(idx)) { if (x == p) { continue; } int next = r + reverses[idx] - reverses[x]; if (x > idx) { next++; } setAns(x, idx, next); } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }