結果
問題 | No.1637 Easy Tree Query |
ユーザー | nishi5451 |
提出日時 | 2021-08-07 10:35:39 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 482 ms / 2,000 ms |
コード長 | 2,932 bytes |
コンパイル時間 | 3,208 ms |
コンパイル使用メモリ | 79,288 KB |
実行使用メモリ | 80,812 KB |
最終ジャッジ日時 | 2023-10-17 17:03:32 |
合計ジャッジ時間 | 17,036 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 57 ms
53,524 KB |
testcase_01 | AC | 51 ms
53,520 KB |
testcase_02 | AC | 374 ms
75,096 KB |
testcase_03 | AC | 52 ms
53,524 KB |
testcase_04 | AC | 212 ms
60,924 KB |
testcase_05 | AC | 299 ms
63,280 KB |
testcase_06 | AC | 251 ms
61,104 KB |
testcase_07 | AC | 173 ms
57,996 KB |
testcase_08 | AC | 186 ms
61,032 KB |
testcase_09 | AC | 338 ms
68,436 KB |
testcase_10 | AC | 206 ms
60,532 KB |
testcase_11 | AC | 396 ms
72,988 KB |
testcase_12 | AC | 370 ms
67,148 KB |
testcase_13 | AC | 165 ms
58,676 KB |
testcase_14 | AC | 298 ms
68,644 KB |
testcase_15 | AC | 379 ms
71,692 KB |
testcase_16 | AC | 344 ms
70,120 KB |
testcase_17 | AC | 193 ms
60,876 KB |
testcase_18 | AC | 287 ms
63,540 KB |
testcase_19 | AC | 282 ms
63,484 KB |
testcase_20 | AC | 346 ms
67,480 KB |
testcase_21 | AC | 263 ms
65,264 KB |
testcase_22 | AC | 435 ms
75,132 KB |
testcase_23 | AC | 215 ms
61,100 KB |
testcase_24 | AC | 262 ms
65,268 KB |
testcase_25 | AC | 286 ms
61,532 KB |
testcase_26 | AC | 389 ms
67,732 KB |
testcase_27 | AC | 482 ms
76,020 KB |
testcase_28 | AC | 256 ms
61,708 KB |
testcase_29 | AC | 325 ms
67,124 KB |
testcase_30 | AC | 208 ms
66,636 KB |
testcase_31 | AC | 204 ms
58,344 KB |
testcase_32 | AC | 239 ms
63,648 KB |
testcase_33 | AC | 270 ms
61,088 KB |
testcase_34 | AC | 204 ms
80,812 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { static final int INF = 1<<30; static final long INFL = 1L<<60; static final int MOD = 1000000007; static final int MOD2 = 998244353; static List<List<Integer>> g; static int[] dp; static void dfs(int v, int pv){ dp[v] = 1; for(int nv : g.get(v)) if(nv != pv){ dfs(nv,v); dp[v] += dp[nv]; } } public static void main(String[] args) { FastScanner fs = new FastScanner(); PrintWriter pw = new PrintWriter(System.out); int n = fs.nextInt(); int Q = fs.nextInt(); g = new ArrayList<>(); for(int i = 0; i < n; i++) g.add(new ArrayList<>()); for(int i = 0; i < n-1; i++){ int a = fs.nextInt() - 1; int b = fs.nextInt() - 1; g.get(a).add(b); g.get(b).add(a); } dp = new int[n]; dfs(0,-1); long ans = 0; for(int i = 0; i < Q; i++){ int p = fs.nextInt() - 1; long x = fs.nextLong(); ans += x*dp[p]; pw.println(ans); } pw.close(); } } class FastScanner { private InputStream in = System.in; private byte[] buffer = new byte[1024]; private int length = 0, p = 0; private boolean hasNextByte() { if (p < length) return true; else{ p = 0; try{ length = in.read(buffer); }catch(Exception e){ e.printStackTrace(); } if(length == 0) return false; } return true; } private int readByte() { if (hasNextByte() == true) return buffer[p++]; return -1; } private static boolean isPrintable(int n) { return 33 <= n && n <= 126; } private void skip() { while (hasNextByte() && !isPrintable(buffer[p])) p++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int temp = readByte(); while (isPrintable(temp)) { sb.appendCodePoint(temp); temp = readByte(); } return sb.toString(); } public int nextInt() { return Math.toIntExact(nextLong()); } public int[] nextInts(int n) { int[] ar = new int[n]; for (int i = 0; i < n; i++) ar[i] = nextInt(); return ar; } public long[] nextLongs(int n) { long[] ar = new long[n]; for (int i = 0; i < n; i++) ar[i] = nextLong(); return ar; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); boolean minus = false; int temp = readByte(); if (temp == '-') { minus = true; temp = readByte(); } if (temp < '0' || '9' < temp) throw new NumberFormatException(); long n = 0; while (isPrintable(temp)) { if ('0' <= temp && temp <= '9') { n *= 10; n += temp - '0'; } temp = readByte(); } return minus ? -n : n; } public char[] nextChars() { String s = next(); return s.toCharArray(); } public char[][] nextCharMat(int h, int w) { char[][] ar = new char[h][w]; for(int i = 0; i < h; i++){ String s = next(); for(int j = 0; j < w; j++){ ar[i][j] = s.charAt(j); } } return ar; } }