結果
問題 | No.1207 グラフX |
ユーザー | tenten |
提出日時 | 2022-04-08 09:44:52 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,952 bytes |
コンパイル時間 | 4,876 ms |
コンパイル使用メモリ | 74,876 KB |
実行使用メモリ | 159,528 KB |
最終ジャッジ日時 | 2023-08-18 20:06:47 |
合計ジャッジ時間 | 63,505 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,376 ms
139,164 KB |
testcase_01 | AC | 1,318 ms
139,480 KB |
testcase_02 | AC | 1,219 ms
140,400 KB |
testcase_03 | AC | 1,210 ms
140,380 KB |
testcase_04 | AC | 1,292 ms
139,400 KB |
testcase_05 | TLE | - |
testcase_06 | TLE | - |
testcase_07 | TLE | - |
testcase_08 | AC | 999 ms
101,780 KB |
testcase_09 | AC | 1,201 ms
106,512 KB |
testcase_10 | AC | 1,483 ms
151,208 KB |
testcase_11 | AC | 1,971 ms
159,528 KB |
testcase_12 | AC | 1,159 ms
97,096 KB |
testcase_13 | AC | 584 ms
56,048 KB |
testcase_14 | AC | 1,214 ms
115,616 KB |
testcase_15 | AC | 1,197 ms
101,996 KB |
testcase_16 | AC | 599 ms
62,728 KB |
testcase_17 | AC | 1,025 ms
89,092 KB |
testcase_18 | AC | 1,043 ms
88,568 KB |
testcase_19 | AC | 876 ms
75,784 KB |
testcase_20 | AC | 1,175 ms
117,488 KB |
testcase_21 | AC | 202 ms
44,104 KB |
testcase_22 | AC | 1,101 ms
87,704 KB |
testcase_23 | AC | 1,135 ms
93,068 KB |
testcase_24 | AC | 811 ms
85,640 KB |
testcase_25 | AC | 1,260 ms
117,116 KB |
testcase_26 | AC | 1,141 ms
98,120 KB |
testcase_27 | AC | 1,632 ms
125,300 KB |
testcase_28 | AC | 1,267 ms
105,964 KB |
testcase_29 | AC | 1,146 ms
112,300 KB |
testcase_30 | AC | 829 ms
69,588 KB |
testcase_31 | AC | 500 ms
51,164 KB |
testcase_32 | AC | 669 ms
70,844 KB |
testcase_33 | AC | 837 ms
72,228 KB |
testcase_34 | AC | 1,144 ms
99,348 KB |
testcase_35 | AC | 216 ms
44,316 KB |
testcase_36 | AC | 1,074 ms
105,756 KB |
testcase_37 | AC | 967 ms
89,552 KB |
testcase_38 | AC | 414 ms
54,828 KB |
testcase_39 | AC | 659 ms
72,996 KB |
testcase_40 | AC | 349 ms
49,072 KB |
testcase_41 | AC | 852 ms
78,052 KB |
testcase_42 | AC | 44 ms
39,120 KB |
testcase_43 | AC | 44 ms
33,500 KB |
testcase_44 | AC | 45 ms
33,516 KB |
testcase_45 | AC | 1,121 ms
124,300 KB |
testcase_46 | AC | 1,114 ms
124,744 KB |
testcase_47 | AC | 1,126 ms
114,124 KB |
testcase_48 | AC | 1,205 ms
126,736 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { static ArrayList<HashMap<Integer, Integer>> 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 HashMap<>()); } 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).put(b, c); graph.get(b).put(a, c); } } getCount(0, 0); System.out.println(ans); } static int getCount(int idx, int p) { int count = 1; for (int x : graph.get(idx).keySet()) { if (x == p) { continue; } int y = graph.get(idx).get(x); int tmp = getCount(x, idx); ans += (long)tmp * (n - tmp) % MOD * pow(base, y) % 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); } } } 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(); } }