結果
問題 | No.2874 Gunegune Tree |
ユーザー | tobisatis |
提出日時 | 2024-09-06 22:25:08 |
言語 | C# (.NET 8.0.203) |
結果 |
AC
|
実行時間 | 155 ms / 2,000 ms |
コード長 | 4,603 bytes |
コンパイル時間 | 7,500 ms |
コンパイル使用メモリ | 167,828 KB |
実行使用メモリ | 207,320 KB |
最終ジャッジ日時 | 2024-09-06 22:25:21 |
合計ジャッジ時間 | 11,458 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
30,208 KB |
testcase_01 | AC | 48 ms
29,824 KB |
testcase_02 | AC | 51 ms
29,952 KB |
testcase_03 | AC | 63 ms
31,872 KB |
testcase_04 | AC | 89 ms
38,016 KB |
testcase_05 | AC | 66 ms
33,024 KB |
testcase_06 | AC | 53 ms
29,952 KB |
testcase_07 | AC | 147 ms
47,872 KB |
testcase_08 | AC | 98 ms
38,400 KB |
testcase_09 | AC | 57 ms
30,848 KB |
testcase_10 | AC | 137 ms
45,056 KB |
testcase_11 | AC | 111 ms
41,856 KB |
testcase_12 | AC | 70 ms
34,176 KB |
testcase_13 | AC | 137 ms
47,616 KB |
testcase_14 | AC | 123 ms
44,672 KB |
testcase_15 | AC | 65 ms
32,544 KB |
testcase_16 | AC | 141 ms
48,640 KB |
testcase_17 | AC | 69 ms
32,000 KB |
testcase_18 | AC | 70 ms
32,512 KB |
testcase_19 | AC | 63 ms
31,488 KB |
testcase_20 | AC | 61 ms
31,996 KB |
testcase_21 | AC | 79 ms
36,096 KB |
testcase_22 | AC | 106 ms
39,040 KB |
testcase_23 | AC | 80 ms
35,676 KB |
testcase_24 | AC | 86 ms
37,888 KB |
testcase_25 | AC | 111 ms
42,880 KB |
testcase_26 | AC | 91 ms
38,400 KB |
testcase_27 | AC | 142 ms
48,244 KB |
testcase_28 | AC | 71 ms
34,560 KB |
testcase_29 | AC | 106 ms
40,516 KB |
testcase_30 | AC | 95 ms
38,272 KB |
testcase_31 | AC | 90 ms
36,864 KB |
testcase_32 | AC | 155 ms
207,320 KB |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (88 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 iz = new ModInt[6]; for (var i = 1; i < 6; i++) iz[i] = (ModInt)1 / i; var m = new ModInt[,] { { iz[2], iz[2], 0, 0, 0 }, { iz[3], iz[3], iz[3], 0, 0 }, { 0, iz[3], iz[3], iz[3], 0 }, { 0, 0, iz[3], iz[3], iz[3] }, { 0, 0, 0, iz[2], iz[2] }, }; var dp = new ModInt[5]; dp[1] = dp[2] = dp[3] = iz[5]; var pp = new ModInt[5]; for (var i = 0; i < 5; i++) pp[i] = iz[5]; for (var d = 2; d <= n; d++) { var ep = new ModInt[5]; var qp = new ModInt[5]; for (var i = 0; i < 5; i++) for (var j = 0; j < 5; j++) { var k = m[i, j]; ep[j] += dp[i] * k; qp[j] += pp[i] * k; if (1 <= j && j <= 3) ep[j] += pp[i] * k; } dp = ep; pp = qp; } ModInt ans = 0; for (var i = 0; i < 5; i++) ans += dp[i]; 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(); } }