結果
問題 | No.2783 4-33 Easy |
ユーザー | tobisatis |
提出日時 | 2024-06-14 22:05:23 |
言語 | C# (.NET 8.0.203) |
結果 |
AC
|
実行時間 | 121 ms / 2,000 ms |
コード長 | 4,923 bytes |
コンパイル時間 | 19,446 ms |
コンパイル使用メモリ | 167,600 KB |
実行使用メモリ | 209,404 KB |
最終ジャッジ日時 | 2024-06-14 22:05:48 |
合計ジャッジ時間 | 23,918 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 64 ms
32,128 KB |
testcase_01 | AC | 63 ms
32,256 KB |
testcase_02 | AC | 63 ms
32,256 KB |
testcase_03 | AC | 62 ms
32,224 KB |
testcase_04 | AC | 92 ms
41,344 KB |
testcase_05 | AC | 97 ms
44,512 KB |
testcase_06 | AC | 86 ms
44,512 KB |
testcase_07 | AC | 82 ms
44,416 KB |
testcase_08 | AC | 85 ms
44,416 KB |
testcase_09 | AC | 100 ms
44,416 KB |
testcase_10 | AC | 101 ms
44,416 KB |
testcase_11 | AC | 102 ms
44,544 KB |
testcase_12 | AC | 98 ms
44,288 KB |
testcase_13 | AC | 103 ms
44,784 KB |
testcase_14 | AC | 102 ms
44,288 KB |
testcase_15 | AC | 104 ms
44,416 KB |
testcase_16 | AC | 103 ms
44,784 KB |
testcase_17 | AC | 100 ms
44,660 KB |
testcase_18 | AC | 101 ms
44,792 KB |
testcase_19 | AC | 108 ms
44,784 KB |
testcase_20 | AC | 106 ms
44,800 KB |
testcase_21 | AC | 102 ms
44,416 KB |
testcase_22 | AC | 104 ms
44,544 KB |
testcase_23 | AC | 105 ms
44,800 KB |
testcase_24 | AC | 103 ms
44,544 KB |
testcase_25 | AC | 121 ms
44,160 KB |
testcase_26 | AC | 105 ms
44,408 KB |
testcase_27 | AC | 102 ms
44,416 KB |
testcase_28 | AC | 103 ms
209,404 KB |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (83 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
namespace AtCoder; #nullable enable using System.Numerics; readonly record struct ModInt : IEqualityOperators<ModInt, ModInt, bool>, IAdditiveIdentity<ModInt, ModInt>, IAdditionOperators<ModInt, ModInt, ModInt>, IUnaryNegationOperators<ModInt, ModInt>, ISubtractionOperators<ModInt, ModInt, ModInt>, IMultiplicativeIdentity<ModInt, ModInt>, IMultiplyOperators<ModInt, ModInt, ModInt>, IDivisionOperators<ModInt, ModInt, ModInt> { int V { get; init; } public const int Mod = 998244353; public ModInt(long value) { var v = value % Mod; if (v < 0) v += Mod; V = (int)v; } ModInt(int value) { V = value; } public static implicit operator ModInt(long v) => new(v); public static implicit operator int(ModInt modInt) => modInt.V; public static ModInt operator +(ModInt a, ModInt b) { var v = a.V + b.V; if (v >= Mod) v -= Mod; return new(v); } public static ModInt operator -(ModInt a) => new(a.V == 0 ? 0 : Mod - a.V); public static ModInt operator -(ModInt a, ModInt b) { var v = a.V - b.V; if (v < 0) v += Mod; return new(v); } public static ModInt operator *(ModInt a, ModInt b) => new((int)((long)a.V * b.V % Mod)); public static ModInt operator /(ModInt a, ModInt b) { if (b == 0) throw new DivideByZeroException(); var (d, x, _) = ExtendedGcd(b.V, Mod); if (d > 1) throw new DivideByZeroException(); return x * a.V; } public ModInt Power(long p) { if (p < 0) return (MultiplicativeIdentity / V).Power(-p); long res = 1; long k = V; while (p > 0) { if ((p & 1) > 0) res = res * k % Mod; k = k * k % Mod; p >>= 1; } return res; } static (long d, long x, long y) ExtendedGcd(long a, long b) { if (b == 0) return (a, 1, 0); var (d, x, y) = ExtendedGcd(b, a % b); return (d, y, x - a / b * y); } public static ModInt AdditiveIdentity => new(0); public static ModInt MultiplicativeIdentity => new(1); public override string ToString() => V.ToString(); } static class Extensions { public static T[] Repeat<T>(this int time, Func<T> F) => Enumerable.Range(0, time).Select(_ => F()).ToArray(); } class AtCoder { object? Solve() { var n = Int(); var az = n.Repeat(Int); var bz = new int[n]; var ez = new bool[n]; for (var i = 0; i < n; i++) { var bs = String(); if (bs == "X") { ez[i] = true; } else if (bs[^1] == 'X') { bz[i] = int.Parse(bs[0..^1]); ez[i] = true; } else bz[i] = int.Parse(bs); } var dp = new ModInt[9, 5, 34]; dp[0, 0, 0] = 1; for (var i = 0; i < n; i++) { var (a, b, e) = (az[i], bz[i], ez[i]); if (ez[i]) continue; var ep = new ModInt[9, 5, 34]; for (var t = 0; t <= 8; t++) for (var pa = 0; pa <= 4; pa++) for (var pb = 0; pb <= 33; pb++) { var v = dp[t, pa, pb]; if (v == 0) continue; ep[t, pa, pb] += v; var (nt, na, nb) = (t + 1, pa + a, pb + b); if (nt <= 8 && na <= 4 && nb <= 33) ep[nt, na, nb] += v; } dp = ep; } ModInt ans = 0; for (var i = 0; i < n; i++) { var (a, b, e) = (az[i], bz[i], ez[i]); if (!ez[i]) continue; if (b != 0) continue; ans += dp[8, 4 - a, 33]; } return ans; } public static void Main() => new AtCoder().Run(); public void Run() { var res = Solve(); if (res != null) { if (res is bool yes) res = yes ? "Yes" : "No"; sw.WriteLine(res); } sw.Flush(); } string[] input = Array.Empty<string>(); int iter = 0; readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false }; string String() { while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Split(' '), 0); return input[iter++]; } T Input<T>() where T : IParsable<T> => T.Parse(String(), null); int Int() => Input<int>(); void Out(object? x, string? separator = null) { separator ??= Environment.NewLine; if (x is System.Collections.IEnumerable obj and not string) { var firstLine = true; foreach (var item in obj) { if (!firstLine) sw.Write(separator); firstLine = false; sw.Write(item); } } else sw.Write(x); sw.WriteLine(); } }