結果

問題 No.1507 Road Blocked
ユーザー shojin_proshojin_pro
提出日時 2021-05-14 23:24:06
言語 Java21
(openjdk 21)
結果
AC  
実行時間 683 ms / 2,000 ms
コード長 4,715 bytes
コンパイル時間 2,602 ms
コンパイル使用メモリ 80,492 KB
実行使用メモリ 86,432 KB
最終ジャッジ日時 2024-10-02 05:12:11
合計ジャッジ時間 23,198 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
41,940 KB
testcase_01 AC 58 ms
41,432 KB
testcase_02 AC 60 ms
41,740 KB
testcase_03 AC 442 ms
86,432 KB
testcase_04 AC 683 ms
70,504 KB
testcase_05 AC 552 ms
65,312 KB
testcase_06 AC 620 ms
70,808 KB
testcase_07 AC 673 ms
70,596 KB
testcase_08 AC 654 ms
70,996 KB
testcase_09 AC 662 ms
70,920 KB
testcase_10 AC 651 ms
70,804 KB
testcase_11 AC 534 ms
65,420 KB
testcase_12 AC 551 ms
65,460 KB
testcase_13 AC 678 ms
70,632 KB
testcase_14 AC 500 ms
62,756 KB
testcase_15 AC 682 ms
70,688 KB
testcase_16 AC 548 ms
65,332 KB
testcase_17 AC 539 ms
65,524 KB
testcase_18 AC 669 ms
70,760 KB
testcase_19 AC 619 ms
70,696 KB
testcase_20 AC 674 ms
70,620 KB
testcase_21 AC 655 ms
70,444 KB
testcase_22 AC 663 ms
70,784 KB
testcase_23 AC 670 ms
70,788 KB
testcase_24 AC 670 ms
70,716 KB
testcase_25 AC 549 ms
65,812 KB
testcase_26 AC 544 ms
70,372 KB
testcase_27 AC 548 ms
70,396 KB
testcase_28 AC 674 ms
70,704 KB
testcase_29 AC 554 ms
66,788 KB
testcase_30 AC 674 ms
70,804 KB
testcase_31 AC 612 ms
70,980 KB
testcase_32 AC 670 ms
70,928 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 998244353;
    
    static int N;
    static int[] A = new int[1 << 18], B = new int[1 << 18];
    static long[] dp = new long[1 << 18];
    static ArrayList<ArrayList<Integer>> G = new ArrayList<>();
    
    static void dfs(int pos, int pre) {
    	dp[pos] = 1;
    	for (int i : G.get(pos)) {
    		if (i == pre) continue;
    		dfs(i, pos);
    		dp[pos] += dp[i];
    	}
    }

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
    	N = sc.nextInt();
    	for(int i = 0; i < N; i++) G.add(new ArrayList<>());
    	for (int i = 0; i < N - 1; i++) {
    		A[i] = sc.nextInt()-1; B[i] = sc.nextInt()-1;
    		G.get(A[i]).add(B[i]);
    		G.get(B[i]).add(A[i]);
    	}
    
    	dfs(1, -1);
    
    	long num = 0;
    	for (int i = 0; i < N-1; i++) {
    		long r = Math.min(dp[A[i]], dp[B[i]]);
    		num += r * (long)(N - r);
    	}
    	long deno = 1L*(long)N*(long)(N-1)/2L*(long)(N-1);
    	num = (deno-num);
    	long gcd = gcd(num,deno);
    	num /= gcd; deno /= gcd;
    	num %= mod; deno %= mod;
    	long ans = rep2(deno,mod-2,mod);
    	num *= ans;
    	num %= mod;
    	pw.println(num);
    }
    
    private static long gcd(long a, long b)
    {
        while (b > 0)
        {
            long temp = b;
            b = a % b; // % is remainder
            a = temp;
        }
        return a;
    }
    
    private static long rep2(long b, long n, long mod){
        if(n == 0) return 1;
        long bn = rep2(b,n/2,mod);
        if(n % 2 == 0){
            return (bn*bn)%mod;
        }else{
            return (bn*bn)%mod*b%mod;
        }
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0