結果

問題 No.1098 LCAs
ユーザー OlandOland
提出日時 2020-06-26 22:32:34
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,838 ms / 2,000 ms
コード長 7,250 bytes
コンパイル時間 2,545 ms
コンパイル使用メモリ 81,328 KB
実行使用メモリ 110,204 KB
最終ジャッジ日時 2024-07-04 22:17:31
合計ジャッジ時間 16,877 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,464 KB
testcase_01 AC 52 ms
50,512 KB
testcase_02 AC 52 ms
50,612 KB
testcase_03 AC 54 ms
50,288 KB
testcase_04 AC 53 ms
50,496 KB
testcase_05 AC 54 ms
50,456 KB
testcase_06 AC 52 ms
50,272 KB
testcase_07 AC 53 ms
50,040 KB
testcase_08 AC 54 ms
50,256 KB
testcase_09 AC 54 ms
50,092 KB
testcase_10 AC 54 ms
50,204 KB
testcase_11 AC 53 ms
50,364 KB
testcase_12 AC 55 ms
50,448 KB
testcase_13 AC 78 ms
51,304 KB
testcase_14 AC 80 ms
51,396 KB
testcase_15 AC 88 ms
51,204 KB
testcase_16 AC 77 ms
51,408 KB
testcase_17 AC 90 ms
51,260 KB
testcase_18 AC 702 ms
84,252 KB
testcase_19 AC 712 ms
84,268 KB
testcase_20 AC 700 ms
84,200 KB
testcase_21 AC 703 ms
84,124 KB
testcase_22 AC 680 ms
84,116 KB
testcase_23 AC 624 ms
83,400 KB
testcase_24 AC 615 ms
84,024 KB
testcase_25 AC 615 ms
83,652 KB
testcase_26 AC 682 ms
87,236 KB
testcase_27 AC 677 ms
86,824 KB
testcase_28 AC 1,821 ms
109,220 KB
testcase_29 AC 1,838 ms
110,204 KB
testcase_30 AC 949 ms
101,448 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.BigDecimal;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    
    int N;
    ArrayList<ArrayList<Integer>> g;
    int[] num;
    long[] ans;
    
    void solve(){
        N = in.nextInt();
        g = new ArrayList<>();
        for(int i = 0; i < N; i++) g.add(new ArrayList<>());
        for(int i = 0; i < N - 1; i++){
            int v = in.nextInt()-1;
            int w = in.nextInt()-1;
            g.get(v).add(w);
            g.get(w).add(v);
        }
        num = new int[N];
        ans = new long[N];
        dfs(0, -1);
        for(long a : ans) out.println(a);
    }
    
    void dfs(int v, int p){
        for(int to : g.get(v)){
            if(to == p) continue;
            dfs(to, v);
            num[v] += num[to] + 1;
        }
        ans[v] = 1 + num[v] * 2 + (long)num[v] * (num[v] - 1);
        for(int to : g.get(v)){
            if(to == p) continue;
            ans[v] -= (long)(num[to] + 1) * num[to];
        }
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0