結果

問題 No.1637 Easy Tree Query
ユーザー nishi5451
提出日時 2021-08-07 10:35:39
言語 Java
(openjdk 23)
結果
AC  
実行時間 447 ms / 2,000 ms
コード長 2,932 bytes
コンパイル時間 2,427 ms
コンパイル使用メモリ 79,052 KB
実行使用メモリ 77,132 KB
最終ジャッジ日時 2024-09-17 14:29:41
合計ジャッジ時間 16,045 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0