結果
問題 | No.1207 グラフX |
ユーザー | tenten |
提出日時 | 2022-04-08 13:47:30 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,392 ms / 2,000 ms |
コード長 | 3,119 bytes |
コンパイル時間 | 4,800 ms |
コンパイル使用メモリ | 77,196 KB |
実行使用メモリ | 158,592 KB |
最終ジャッジ日時 | 2023-08-18 20:59:58 |
合計ジャッジ時間 | 52,696 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,187 ms
112,492 KB |
testcase_01 | AC | 853 ms
97,468 KB |
testcase_02 | AC | 893 ms
97,876 KB |
testcase_03 | AC | 851 ms
97,868 KB |
testcase_04 | AC | 854 ms
95,320 KB |
testcase_05 | AC | 1,343 ms
158,592 KB |
testcase_06 | AC | 1,392 ms
124,104 KB |
testcase_07 | AC | 1,372 ms
154,852 KB |
testcase_08 | AC | 945 ms
78,868 KB |
testcase_09 | AC | 838 ms
89,412 KB |
testcase_10 | AC | 971 ms
118,888 KB |
testcase_11 | AC | 1,319 ms
119,928 KB |
testcase_12 | AC | 833 ms
86,088 KB |
testcase_13 | AC | 486 ms
65,136 KB |
testcase_14 | AC | 850 ms
96,192 KB |
testcase_15 | AC | 906 ms
90,500 KB |
testcase_16 | AC | 524 ms
65,140 KB |
testcase_17 | AC | 825 ms
78,960 KB |
testcase_18 | AC | 662 ms
78,968 KB |
testcase_19 | AC | 651 ms
71,708 KB |
testcase_20 | AC | 852 ms
95,500 KB |
testcase_21 | AC | 196 ms
55,332 KB |
testcase_22 | AC | 688 ms
79,580 KB |
testcase_23 | AC | 757 ms
85,884 KB |
testcase_24 | AC | 579 ms
76,616 KB |
testcase_25 | AC | 1,301 ms
110,932 KB |
testcase_26 | AC | 763 ms
84,616 KB |
testcase_27 | AC | 792 ms
96,048 KB |
testcase_28 | AC | 823 ms
89,016 KB |
testcase_29 | AC | 924 ms
90,088 KB |
testcase_30 | AC | 603 ms
70,912 KB |
testcase_31 | AC | 444 ms
62,676 KB |
testcase_32 | AC | 507 ms
68,800 KB |
testcase_33 | AC | 643 ms
73,664 KB |
testcase_34 | AC | 803 ms
90,600 KB |
testcase_35 | AC | 208 ms
55,948 KB |
testcase_36 | AC | 788 ms
89,068 KB |
testcase_37 | AC | 766 ms
77,808 KB |
testcase_38 | AC | 375 ms
61,652 KB |
testcase_39 | AC | 610 ms
73,796 KB |
testcase_40 | AC | 354 ms
59,800 KB |
testcase_41 | AC | 653 ms
74,732 KB |
testcase_42 | AC | 42 ms
49,460 KB |
testcase_43 | AC | 44 ms
49,392 KB |
testcase_44 | AC | 46 ms
49,504 KB |
testcase_45 | AC | 830 ms
94,904 KB |
testcase_46 | AC | 831 ms
95,108 KB |
testcase_47 | AC | 828 ms
96,036 KB |
testcase_48 | AC | 1,251 ms
106,568 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { static ArrayList<ArrayList<Path>> graph = new ArrayList<>(); static final int MOD = 1000000007; static int n; static int base; static long ans = 0; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); n = sc.nextInt(); int m = sc.nextInt(); base = sc.nextInt(); for (int i = 0; i < n; i++) { graph.add(new ArrayList<>()); } UnionFindTree uft = new UnionFindTree(n); for (int i = 0; i < m; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; int c = sc.nextInt(); if (!uft.same(a, b)) { uft.unite(a, b); graph.get(a).add(new Path(b, c)); graph.get(b).add(new Path(a, c)); } } getCount(0, 0); System.out.println(ans); } static int getCount(int idx, int p) { int count = 1; for (Path x : graph.get(idx)) { if (x.idx == p) { continue; } int tmp = getCount(x.idx, idx); ans += (long)tmp * (n - tmp) % MOD * pow(base, x.value) % MOD; ans %= MOD; count += tmp; } return count; } static long pow(long x, int p) { if (p == 0) { return 1; } else if (p % 2 == 0) { return pow(x * x % MOD, p / 2); } else { return pow(x, p - 1) * x % MOD; } } static class UnionFindTree { int[] parents; public UnionFindTree(int size) { parents = new int[size]; for (int i = 0; i < size; i++) { parents[i] = i; } } public int find(int x) { if (x == parents[x]) { return x; } else { return parents[x] = find(parents[x]); } } public boolean same(int x, int y) { return find(x) == find(y); } public void unite(int x, int y) { parents[find(x)] = find(y); } } static class Path { int idx; int value; public Path(int idx, int value) { this.idx = idx; this.value = value; } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }