結果
問題 | No.1207 グラフX |
ユーザー | tenten |
提出日時 | 2021-12-01 10:19:20 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,201 bytes |
コンパイル時間 | 3,783 ms |
コンパイル使用メモリ | 74,236 KB |
実行使用メモリ | 156,284 KB |
最終ジャッジ日時 | 2023-09-17 14:10:09 |
合計ジャッジ時間 | 49,959 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 892 ms
84,400 KB |
testcase_01 | AC | 1,256 ms
97,400 KB |
testcase_02 | AC | 906 ms
84,948 KB |
testcase_03 | AC | 928 ms
83,704 KB |
testcase_04 | AC | 928 ms
83,756 KB |
testcase_05 | TLE | - |
testcase_06 | AC | 1,415 ms
154,368 KB |
testcase_07 | AC | 1,424 ms
156,284 KB |
testcase_08 | AC | 965 ms
78,896 KB |
testcase_09 | AC | 960 ms
87,496 KB |
testcase_10 | AC | 1,303 ms
107,680 KB |
testcase_11 | AC | 1,436 ms
146,864 KB |
testcase_12 | AC | 792 ms
83,224 KB |
testcase_13 | AC | 518 ms
56,724 KB |
testcase_14 | AC | 851 ms
97,212 KB |
testcase_15 | AC | 968 ms
79,676 KB |
testcase_16 | AC | 538 ms
56,440 KB |
testcase_17 | AC | 884 ms
69,836 KB |
testcase_18 | AC | 814 ms
79,568 KB |
testcase_19 | AC | 651 ms
63,148 KB |
testcase_20 | AC | 868 ms
87,972 KB |
testcase_21 | AC | 201 ms
47,516 KB |
testcase_22 | AC | 827 ms
69,664 KB |
testcase_23 | AC | 929 ms
76,376 KB |
testcase_24 | AC | 587 ms
67,104 KB |
testcase_25 | AC | 924 ms
87,992 KB |
testcase_26 | AC | 941 ms
76,828 KB |
testcase_27 | AC | 1,348 ms
101,484 KB |
testcase_28 | AC | 844 ms
90,400 KB |
testcase_29 | AC | 934 ms
89,684 KB |
testcase_30 | AC | 561 ms
70,996 KB |
testcase_31 | AC | 455 ms
60,704 KB |
testcase_32 | AC | 470 ms
65,984 KB |
testcase_33 | AC | 562 ms
70,708 KB |
testcase_34 | AC | 797 ms
89,972 KB |
testcase_35 | AC | 208 ms
55,408 KB |
testcase_36 | AC | 795 ms
89,204 KB |
testcase_37 | AC | 907 ms
77,660 KB |
testcase_38 | AC | 361 ms
61,188 KB |
testcase_39 | AC | 539 ms
72,600 KB |
testcase_40 | AC | 356 ms
59,856 KB |
testcase_41 | AC | 639 ms
74,356 KB |
testcase_42 | AC | 45 ms
49,756 KB |
testcase_43 | AC | 45 ms
49,460 KB |
testcase_44 | AC | 45 ms
49,332 KB |
testcase_45 | AC | 838 ms
95,696 KB |
testcase_46 | AC | 838 ms
96,248 KB |
testcase_47 | AC | 842 ms
95,060 KB |
testcase_48 | AC | 867 ms
94,700 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { static int n; static ArrayList<ArrayList<Path>> graph = new ArrayList<>(); static int x; static long ans = 0; static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); n = sc.nextInt(); int m = sc.nextInt(); x = 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 left = sc.nextInt() - 1; int right = sc.nextInt() - 1; int cost = sc.nextInt(); if (uft.same(left, right)) { continue; } uft.unite(left, right); graph.get(left).add(new Path(right, cost)); graph.get(right).add(new Path(left, cost)); } getCount(0, 0); System.out.println(ans); } static long getCount(int idx, int p) { long count = 1; for (Path y : graph.get(idx)) { if (y.idx == p) { continue; } long tmp = getCount(y.idx, idx); ans += (n - tmp) * tmp % MOD * pow(x, y.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 Path { int idx; int value; public Path(int idx, int value) { this.idx = idx; this.value = value; } } static class UnionFindTree { int[] parent; public UnionFindTree(int size) { parent = new int[size]; for (int i = 0; i < size; i++) { parent[i] = i; } } public int find(int x) { if (parent[x] == x) { return x; } else { return parent[x] = find(parent[x]); } } public boolean same(int x, int y) { return find(x) == find(y); } public void unite(int x, int y) { if (!same(x, y)) { parent[find(x)] = find(y); } } } } 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(); } }