結果

問題 No.3004 ヤング図形
ユーザー tobisatis
提出日時 2025-01-17 23:12:55
言語 C#
(.NET 8.0.404)
結果
AC  
実行時間 2,965 ms / 4,000 ms
コード長 4,065 bytes
コンパイル時間 13,909 ms
コンパイル使用メモリ 168,352 KB
実行使用メモリ 197,952 KB
最終ジャッジ日時 2025-01-17 23:14:00
合計ジャッジ時間 64,473 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (112 ミリ秒)。
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

#nullable enable

using System.Numerics;

void Solve()
{
    ModInt e1 = 1;
    ModInt e2 = 1;
    ModInt e3 = 1;
    var sp = 0;
    var sm = 0;
    var k = Int();
    for (var i = 0; i < k; i++)
    {
        var l = Int();
        var m = Int();
        var p = l * m;
        sp += p;
        sm += m;
        ModInt q = 1;
        for (var j = 1; j <= l; j++) q *= j;
        e2 *= q.Power(m);
        for (var j = 1; j <= m; j++) e3 *= j;
    }
    for (var i = 1; i <= sp; i++) e1 *= i;
    Out(e1 / (e2 * e3));
}

#region
AtCoderIO _io_;
var _backend_ = new StandardIOBackend();
_io_ = new(){ Backend = _backend_ };
Solve();
_backend_.Flush();

string String() => _io_.Next();
int Int() => int.Parse(String());
void Out(object? x, string? sep = null) => _io_.Out(x, sep ?? Environment.NewLine);

class AtCoderIO
{
    public required StandardIOBackend Backend { get; init; }

    Memory<string> _input = Array.Empty<string>();
    int _iter = 0;
    public string Next()
    {
        while (_iter >= _input.Length) (_input, _iter) = (Backend.ReadLine().Split(' '), 0);
        return _input.Span[_iter++];
    }

    public void Out(object? x, string separator)
    {
        if (x is System.Collections.IEnumerable obj and not string)
            x = string.Join(separator, obj.Cast<object>());
        Backend.WriteLine(x);
    }
}

class StandardIOBackend
{
    readonly StreamReader _sr = new(Console.OpenStandardInput());
    readonly StreamWriter _sw = new(Console.OpenStandardOutput()) { AutoFlush = false };
    public string ReadLine() => _sr.ReadLine()!;
    public void WriteLine(object? value) => _sw.WriteLine(value);
    public void Flush() => _sw.Flush();
}
#endregion

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>,
    // IAdditiveGroup<ModInt>,
    // IMultiplicativeGroup<ModInt>
{
    public const int Mod = 998244353;
    int V { get; init; }
    public ModInt(long value)
    {
        var v = value % Mod;
        if (v < 0) v += Mod;
        V = (int)v;
    }
    static ModInt New(int value) => new(){ V = value };

    public static implicit operator ModInt(long v) => new(v);
    public static implicit operator int(ModInt modInt) => modInt.V;

    public static ModInt AdditiveIdentity => New(0);
    public static ModInt operator +(ModInt a, ModInt b)
    {
        var v = a.V + b.V;
        if (v >= Mod) v -= Mod;
        return New(v);
    }
    public ModInt ToAdditiveInverse()
    {
        if (V == 0) return AdditiveIdentity;
        return New(Mod - 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 MultiplicativeIdentity => New(1);
    public static ModInt operator *(ModInt a, ModInt b) => New((int)((long)a.V * b.V % Mod));
    public ModInt ToMultiplicativeInverse()
    {
        if (V == 0) throw new DivideByZeroException();
        var (d, x, _) = ExtendedGCD(V, Mod);
        if (d > 1) throw new DivideByZeroException();
        return x;
    }
    public static ModInt operator /(ModInt a, ModInt b) => a * b.ToMultiplicativeInverse();

    static long Power(long v, ulong p, long mod)
    {
        var (res, k) = (1L, v);
        while (p > 0)
        {
            if ((p & 1) > 0) res = res * k % mod;
            k = k * k % mod;
            p >>= 1;
        }
        return res;
    }
    public ModInt Power(long p) => p < 0 ? (MultiplicativeIdentity / V).Power(-p) : Power(V, (ulong)p, Mod);

    static (long d, long x, long y) ExtendedGCD(long a, long b)
    {
        var (x0, y0, x1, y1) = (1L, 0L, 0L, 1L);
        while (b != 0)
        {
            var q = a / b;
            (a, b) = (b, a - q * b);
            (x0, y0, x1, y1) = (x1, y1, x0 - q * x1, y0 - q * y1);
        }
        return (a, x0, y0);
    }

    public override string ToString() => V.ToString();
}
0