#503476 (Java21) No.1098 LCAs

提出ソース

結果

問題	No.1098 LCAs
ユーザー	Oland
提出日時	2020-06-26 22:35:28
言語	Java21 (openjdk 21)
結果	TLE (最新) AC (最初)
実行時間	-
コード長	6,230 bytes
コンパイル時間	2,595 ms
コンパイル使用メモリ	84,636 KB
実行使用メモリ	113,880 KB
最終ジャッジ日時	2023-09-18 06:03:25
合計ジャッジ時間	18,067 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	56 ms 52,268 KB
testcase_01	AC	55 ms 51,880 KB
testcase_02	AC	55 ms 51,956 KB
testcase_03	AC	57 ms 52,160 KB
testcase_04	AC	57 ms 52,676 KB
testcase_05	AC	57 ms 52,056 KB
testcase_06	AC	57 ms 52,004 KB
testcase_07	AC	58 ms 52,676 KB
testcase_08	AC	56 ms 52,296 KB
testcase_09	AC	56 ms 51,868 KB
testcase_10	AC	54 ms 51,880 KB
testcase_11	AC	55 ms 51,844 KB
testcase_12	AC	56 ms 51,844 KB
testcase_13	AC	82 ms 54,024 KB
testcase_14	AC	82 ms 56,340 KB
testcase_15	AC	82 ms 53,720 KB
testcase_16	AC	93 ms 54,240 KB
testcase_17	AC	81 ms 53,952 KB
testcase_18	AC	738 ms 86,360 KB
testcase_19	AC	755 ms 87,720 KB
testcase_20	AC	741 ms 88,388 KB
testcase_21	AC	743 ms 87,900 KB
testcase_22	AC	759 ms 88,060 KB
testcase_23	AC	673 ms 88,780 KB
testcase_24	AC	692 ms 90,116 KB
testcase_25	AC	652 ms 89,876 KB
testcase_26	AC	754 ms 92,544 KB
testcase_27	AC	755 ms 92,108 KB
testcase_28	TLE	-
testcase_29	TLE	-
testcase_30	AC	1,006 ms 100,288 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main implements Runnable{
    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) {
        Thread.setDefaultUncaughtExceptionHandler((t,e)->System.exit(1));
        new Thread(null, new Main(), "", 256L * 1024 * 1024).start();
    }
    
    public void run() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        solve();
        out.flush();
    }
    
    static class FastScanner {
        Reader input;
        
        FastScanner() {this(System.in);}
        FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        
        int nextInt() {return (int) nextLong();}
        
        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;
            }
        }
        
        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;
            }
        }
        
        char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        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 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;
        }
    }
}

yukicoder

結果

テストケース

ソースコード