結果

問題 No.2874 Gunegune Tree
ユーザー tobisatis
提出日時 2024-09-06 22:25:08
言語 C#
(.NET 8.0.404)
結果
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
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /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/

ソースコード

diff #
プレゼンテーションモードにする

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();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0