結果

問題 No.2685 Cell Proliferation (Easy)
ユーザー tobisatistobisatis
提出日時 2024-03-20 23:00:40
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 80 ms / 2,000 ms
コード長 4,294 bytes
コンパイル時間 9,138 ms
コンパイル使用メモリ 157,624 KB
実行使用メモリ 179,660 KB
最終ジャッジ日時 2024-03-20 23:00:53
合計ジャッジ時間 12,082 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
31,780 KB
testcase_01 AC 80 ms
33,956 KB
testcase_02 AC 64 ms
32,164 KB
testcase_03 AC 71 ms
33,060 KB
testcase_04 AC 72 ms
33,188 KB
testcase_05 AC 65 ms
32,292 KB
testcase_06 AC 68 ms
32,676 KB
testcase_07 AC 70 ms
32,804 KB
testcase_08 AC 71 ms
32,932 KB
testcase_09 AC 74 ms
33,444 KB
testcase_10 AC 69 ms
32,676 KB
testcase_11 AC 67 ms
32,420 KB
testcase_12 AC 68 ms
32,548 KB
testcase_13 AC 70 ms
32,932 KB
testcase_14 AC 72 ms
33,060 KB
testcase_15 AC 79 ms
33,828 KB
testcase_16 AC 71 ms
32,932 KB
testcase_17 AC 62 ms
31,780 KB
testcase_18 AC 69 ms
32,676 KB
testcase_19 AC 69 ms
32,804 KB
testcase_20 AC 66 ms
32,292 KB
testcase_21 AC 64 ms
32,164 KB
testcase_22 AC 76 ms
33,572 KB
testcase_23 AC 66 ms
32,420 KB
testcase_24 AC 77 ms
33,956 KB
testcase_25 AC 72 ms
33,316 KB
testcase_26 AC 70 ms
32,932 KB
testcase_27 AC 65 ms
32,292 KB
testcase_28 AC 69 ms
179,660 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (110 ms)。
MSBuild のバージョン 17.7.3+8ec440e68 (.NET)
  main -> /home/judge/data/code/bin/Release/net7.0/main.dll
  main -> /home/judge/data/code/bin/Release/net7.0/publish/

ソースコード

diff # 

namespace AtCoder;

#nullable enable

using System.Numerics;

static class Extensions
{
    public static T[] Repeat<T>(this int time, Func<T> F) => Enumerable.Range(0, time).Select(_ => F()).ToArray();
}

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

class AtCoder
{
    object? Solve()
    {
        ModInt p = Int();
        p /= Int();
        ModInt q = Int();
        q /= Int();
        var t = Int();

        var qz = new ModInt[t + 1];
        qz[1] = q;
        for (var i = 2; i <= t; i++) qz[i] = qz[i - 1] * q;
        var dp = new ModInt[1];
        dp[0] = 1;
        ModInt ans = 1;
        for (var i = 1; i <= t; i++)
        {
            var ep = new ModInt[i + 1];
            for (var j = 0; j < i; j++) ep[j] = dp[j];
            ep[i] = ans * p;
            for (var j = i - 1; j >= 0; j--) ep[j] *= qz[i - j];
            ans = 0;
            for (var j = 0; j <= i; j++) ans += ep[j];
            dp = ep;
        }
        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 };

    #pragma warning disable IDE0051
    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();
    }
    #pragma warning restore IDE0051
}
0