結果
問題 | No.2277 Honest or Dishonest ? |
ユーザー | tenten |
提出日時 | 2023-07-26 19:05:30 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 387 ms / 2,000 ms |
コード長 | 3,462 bytes |
コンパイル時間 | 5,834 ms |
コンパイル使用メモリ | 96,560 KB |
実行使用メモリ | 60,568 KB |
最終ジャッジ日時 | 2024-04-14 08:34:04 |
合計ジャッジ時間 | 20,255 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
50,632 KB |
testcase_01 | AC | 53 ms
50,380 KB |
testcase_02 | AC | 54 ms
50,528 KB |
testcase_03 | AC | 327 ms
58,596 KB |
testcase_04 | AC | 372 ms
58,884 KB |
testcase_05 | AC | 243 ms
56,960 KB |
testcase_06 | AC | 308 ms
58,676 KB |
testcase_07 | AC | 287 ms
57,712 KB |
testcase_08 | AC | 230 ms
58,980 KB |
testcase_09 | AC | 284 ms
57,900 KB |
testcase_10 | AC | 259 ms
56,812 KB |
testcase_11 | AC | 173 ms
55,480 KB |
testcase_12 | AC | 230 ms
55,656 KB |
testcase_13 | AC | 309 ms
58,868 KB |
testcase_14 | AC | 250 ms
56,756 KB |
testcase_15 | AC | 216 ms
57,756 KB |
testcase_16 | AC | 265 ms
57,412 KB |
testcase_17 | AC | 209 ms
55,372 KB |
testcase_18 | AC | 314 ms
58,688 KB |
testcase_19 | AC | 334 ms
58,628 KB |
testcase_20 | AC | 300 ms
58,772 KB |
testcase_21 | AC | 277 ms
57,448 KB |
testcase_22 | AC | 286 ms
57,952 KB |
testcase_23 | AC | 291 ms
58,700 KB |
testcase_24 | AC | 264 ms
57,756 KB |
testcase_25 | AC | 300 ms
59,116 KB |
testcase_26 | AC | 200 ms
60,568 KB |
testcase_27 | AC | 217 ms
55,224 KB |
testcase_28 | AC | 217 ms
56,064 KB |
testcase_29 | AC | 270 ms
57,528 KB |
testcase_30 | AC | 203 ms
55,288 KB |
testcase_31 | AC | 271 ms
57,468 KB |
testcase_32 | AC | 266 ms
59,464 KB |
testcase_33 | AC | 329 ms
58,672 KB |
testcase_34 | AC | 335 ms
58,640 KB |
testcase_35 | AC | 173 ms
55,668 KB |
testcase_36 | AC | 252 ms
57,516 KB |
testcase_37 | AC | 320 ms
58,504 KB |
testcase_38 | AC | 175 ms
54,980 KB |
testcase_39 | AC | 199 ms
55,232 KB |
testcase_40 | AC | 176 ms
55,652 KB |
testcase_41 | AC | 323 ms
59,052 KB |
testcase_42 | AC | 270 ms
57,700 KB |
testcase_43 | AC | 337 ms
58,704 KB |
testcase_44 | AC | 375 ms
58,812 KB |
testcase_45 | AC | 372 ms
59,144 KB |
testcase_46 | AC | 380 ms
58,984 KB |
testcase_47 | AC | 365 ms
58,720 KB |
testcase_48 | AC | 387 ms
58,996 KB |
testcase_49 | AC | 339 ms
58,724 KB |
testcase_50 | AC | 342 ms
58,764 KB |
testcase_51 | AC | 345 ms
58,660 KB |
testcase_52 | AC | 335 ms
59,004 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static final int MOD = 998244353; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int q = sc.nextInt(); UnionFindTree uft = new UnionFindTree(n); while (q-- > 0) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; int c = sc.nextInt(); if (uft.same(a, b)) { if ((uft.getCount(a) + uft.getCount(b)) % 2 != c) { System.out.println(0); return; } } else { uft.unite(a, b, c); } } HashSet<Integer> counts = new HashSet<>(); for (int i = 0; i < n; i++) { counts.add(uft.find(i)); } System.out.println(pow(2, counts.size())); } 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; int[] counts; public UnionFindTree(int size) { parents = new int[size]; counts = 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 { int p = find(parents[x]); counts[x] += counts[parents[x]]; return parents[x] = p; } } public boolean same(int x, int y) { return find(x) == find(y); } public int getCount(int x) { find(x); return counts[x]; } public void unite(int x, int y, int v) { int xx = find(x); int yy = find(y); if ((getCount(x) + getCount(y)) % 2 != v) { counts[xx] = 1; } parents[xx] = yy; } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); 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 int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }