結果
問題 | No.2277 Honest or Dishonest ? |
ユーザー | 👑 hos.lyric |
提出日時 | 2023-04-21 22:44:48 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 66 ms / 2,000 ms |
コード長 | 4,482 bytes |
コンパイル時間 | 1,687 ms |
コンパイル使用メモリ | 151,812 KB |
実行使用メモリ | 7,280 KB |
最終ジャッジ日時 | 2024-06-22 17:48:05 |
合計ジャッジ時間 | 5,118 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 60 ms
6,944 KB |
testcase_04 | AC | 58 ms
6,940 KB |
testcase_05 | AC | 18 ms
6,944 KB |
testcase_06 | AC | 52 ms
6,940 KB |
testcase_07 | AC | 39 ms
6,940 KB |
testcase_08 | AC | 13 ms
6,944 KB |
testcase_09 | AC | 35 ms
6,940 KB |
testcase_10 | AC | 33 ms
6,940 KB |
testcase_11 | AC | 15 ms
6,944 KB |
testcase_12 | AC | 31 ms
6,940 KB |
testcase_13 | AC | 58 ms
6,944 KB |
testcase_14 | AC | 41 ms
6,940 KB |
testcase_15 | AC | 16 ms
6,940 KB |
testcase_16 | AC | 40 ms
6,940 KB |
testcase_17 | AC | 21 ms
6,944 KB |
testcase_18 | AC | 53 ms
6,944 KB |
testcase_19 | AC | 52 ms
6,940 KB |
testcase_20 | AC | 44 ms
6,944 KB |
testcase_21 | AC | 44 ms
6,944 KB |
testcase_22 | AC | 38 ms
6,944 KB |
testcase_23 | AC | 62 ms
6,940 KB |
testcase_24 | AC | 33 ms
6,940 KB |
testcase_25 | AC | 38 ms
6,940 KB |
testcase_26 | AC | 8 ms
6,940 KB |
testcase_27 | AC | 30 ms
6,944 KB |
testcase_28 | AC | 17 ms
6,940 KB |
testcase_29 | AC | 27 ms
6,940 KB |
testcase_30 | AC | 28 ms
6,944 KB |
testcase_31 | AC | 44 ms
6,944 KB |
testcase_32 | AC | 24 ms
6,944 KB |
testcase_33 | AC | 54 ms
6,944 KB |
testcase_34 | AC | 61 ms
6,940 KB |
testcase_35 | AC | 5 ms
6,944 KB |
testcase_36 | AC | 40 ms
6,940 KB |
testcase_37 | AC | 62 ms
6,940 KB |
testcase_38 | AC | 16 ms
6,940 KB |
testcase_39 | AC | 22 ms
6,940 KB |
testcase_40 | AC | 6 ms
6,940 KB |
testcase_41 | AC | 63 ms
6,940 KB |
testcase_42 | AC | 44 ms
6,944 KB |
testcase_43 | AC | 64 ms
6,940 KB |
testcase_44 | AC | 66 ms
6,960 KB |
testcase_45 | AC | 65 ms
6,940 KB |
testcase_46 | AC | 64 ms
6,944 KB |
testcase_47 | AC | 66 ms
6,940 KB |
testcase_48 | AC | 65 ms
6,940 KB |
testcase_49 | AC | 64 ms
6,944 KB |
testcase_50 | AC | 65 ms
6,940 KB |
testcase_51 | AC | 65 ms
7,280 KB |
testcase_52 | AC | 64 ms
6,940 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } struct ModInt(uint M_) { import std.conv : to; alias M = M_; uint x; this(ModInt a) { x = a.x; } this(uint x_) { x = x_ % M; } this(ulong x_) { x = cast(uint)(x_ % M); } this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; } this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); } ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); } ref ModInt opOpAssign(string op, T)(T a) { static if (is(T == ModInt)) { static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; } else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; } else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } else static if (op == "^^") { if (a < 0) return this = inv()^^(-a); ModInt b = this, c = 1U; for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; } return this = c; } else { return mixin("this " ~ op ~ "= ModInt(a)"); } } ModInt inv() const { uint a = M, b = x; int y = 0, z = 1; for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; } assert(a == 1); return ModInt(y); } ModInt opUnary(string op)() const { static if (op == "+") { return this; } else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; } else static assert(false); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } bool opCast(T: bool)() const { return (x != 0U); } string toString() const { return x.to!string; } } enum MO = 998244353; alias Mint = ModInt!MO; int root(int[] uf, int u) { return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u])); } bool connect(int[] uf, int u, int v) { u = uf.root(u); v = uf.root(v); if (u == v) return false; if (uf[u] > uf[v]) swap(u, v); uf[u] += uf[v]; uf[v] = u; return true; } void main() { try { for (; ; ) { const N = readInt; const M = readInt; auto A = new int[M]; auto B = new int[M]; auto C = new int[M]; foreach (i; 0 .. M) { A[i] = readInt - 1; B[i] = readInt - 1; C[i] = readInt; } auto uf = new int[N << 1]; uf[] = -1; foreach (i; 0 .. M) { // uf.connect(A[i] << 1 | 0, B[i] << 1 | (0 ^ C[i])); // uf.connect(A[i] << 1 | 1, B[i] << 1 | (1 ^ C[i])); // ? if (C[i]) { uf.connect(A[i] << 1 | 0, B[i] << 1 | 1); uf.connect(A[i] << 1 | 1, B[i] << 1 | 0); } else { uf.connect(A[i] << 1 | 0, B[i] << 1 | 0); uf.connect(A[i] << 1 | 1, B[i] << 1 | 1); } } bool ok = true; foreach (u; 0 .. N) { ok = ok && (uf.root(u << 1) != uf.root(u << 1 | 1)); } Mint ans; if (ok) { int numComps; foreach (r; 0 .. N << 1) if (uf[r] < 0) { ++numComps; } numComps /= 2; ans = Mint(2)^^numComps; } writeln(ans); } } catch (EOFException e) { } }