結果
問題 | No.1637 Easy Tree Query |
ユーザー | watarimaycry2 |
提出日時 | 2021-10-17 02:04:10 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 962 ms / 2,000 ms |
コード長 | 4,831 bytes |
コンパイル時間 | 3,320 ms |
コンパイル使用メモリ | 80,968 KB |
実行使用メモリ | 107,304 KB |
最終ジャッジ日時 | 2023-10-17 22:21:29 |
合計ジャッジ時間 | 26,162 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
53,736 KB |
testcase_01 | AC | 56 ms
53,728 KB |
testcase_02 | AC | 883 ms
107,304 KB |
testcase_03 | AC | 54 ms
53,736 KB |
testcase_04 | AC | 455 ms
71,332 KB |
testcase_05 | AC | 730 ms
83,596 KB |
testcase_06 | AC | 544 ms
77,924 KB |
testcase_07 | AC | 344 ms
65,584 KB |
testcase_08 | AC | 420 ms
70,388 KB |
testcase_09 | AC | 728 ms
85,580 KB |
testcase_10 | AC | 461 ms
69,448 KB |
testcase_11 | AC | 853 ms
99,788 KB |
testcase_12 | AC | 786 ms
91,612 KB |
testcase_13 | AC | 323 ms
67,812 KB |
testcase_14 | AC | 612 ms
84,432 KB |
testcase_15 | AC | 905 ms
103,984 KB |
testcase_16 | AC | 781 ms
98,176 KB |
testcase_17 | AC | 380 ms
67,776 KB |
testcase_18 | AC | 720 ms
82,804 KB |
testcase_19 | AC | 726 ms
84,236 KB |
testcase_20 | AC | 833 ms
96,468 KB |
testcase_21 | AC | 554 ms
77,608 KB |
testcase_22 | AC | 960 ms
103,776 KB |
testcase_23 | AC | 414 ms
69,040 KB |
testcase_24 | AC | 535 ms
80,444 KB |
testcase_25 | AC | 741 ms
82,796 KB |
testcase_26 | AC | 810 ms
98,468 KB |
testcase_27 | AC | 962 ms
104,252 KB |
testcase_28 | AC | 593 ms
78,008 KB |
testcase_29 | AC | 742 ms
87,252 KB |
testcase_30 | AC | 463 ms
74,424 KB |
testcase_31 | AC | 504 ms
72,988 KB |
testcase_32 | AC | 505 ms
75,852 KB |
testcase_33 | AC | 636 ms
80,180 KB |
testcase_34 | AC | 456 ms
99,692 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; public class Main{ //見なくていいよ ここから------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<>(buf); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.addAll(Arrays.asList(read.split(" "))); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } //入力バッファサイズのつもり。入力点数(スペース区切りでの要素数)が100万を超える場合はバッファサイズを100万にすること static int buf = 1024; static HashMap<Integer, String> CONVSTR = new HashMap<>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList<String> nextCharArray(){return myconv(next(), 0);} static ArrayList<String> nextStrArray(int size){ ArrayList<String> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(next()); } return ret; } static ArrayList<Integer> nextIntArray(int size){ ArrayList<Integer> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Integer.parseInt(next())); } return ret; } static ArrayList<Long> nextLongArray(int size){ ArrayList<Long> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Long.parseLong(next())); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join StringBuilder sb = new StringBuilder(""); String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof long[]){ long[] tmp = (long[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof int[]){ int[] tmp = (int[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof ArrayList){ ArrayList tmp = (ArrayList)list; if(tmp.size() == 0){ return ""; } sb.append(tmp.get(0)); for(int i = 1; i < tmp.size(); i++){ sb.append(joinString).append(tmp.get(i)); } return sb.toString(); }else{ throw new ClassCastException("Don't join"); } } static ArrayList<String> myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList<String>(Arrays.asList(str.split(splitString))); } static ArrayList<String> myconv(String str, String no){ return new ArrayList<String>(Arrays.asList(str.split(no))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //見なくていいよ ここまで------------------------------------------ //このコードをコンパイルするときは、「-encoding UTF-8」を指定すること static void solve(){//ここがメイン関数 int N = nextInt(); int Q = nextInt(); list = new Node[N]; for(int i = 0; i < N; i++){ list[i] = new Node(); } for(int i = 0; i < N - 1; i++){ int L = nextInt() - 1; int R = nextInt() - 1; list[L].child.add(R); list[R].child.add(L); } long sum = 0; dfs(0, -1); for(int i = 0; i < Q; i++){ int p = nextInt() - 1; long x = nextLong(); sum += x * list[p].size; myout(sum); } } //メソッド追加エリア ここから static Node[] list; static int dfs(int now, int parent){ ArrayList<Integer> child = list[now].child; int size = 1; for(int c : child){ if(c != parent){ size += dfs(c, now); } } list[now].size = size; return size; } static class Node{ ArrayList<Integer> child = new ArrayList<>(); int size = 0; Node(){} } //メソッド追加エリア ここまで }