結果

問題 No.2898 Update Max
ユーザー tobisatistobisatis
提出日時 2024-09-20 22:15:37
言語 C#
(.NET 8.0.203)
結果
RE  
実行時間 -
コード長 5,800 bytes
コンパイル時間 8,811 ms
コンパイル使用メモリ 167,172 KB
実行使用メモリ 192,392 KB
最終ジャッジ日時 2024-09-20 22:15:56
合計ジャッジ時間 16,030 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
30,464 KB
testcase_01 AC 54 ms
29,824 KB
testcase_02 AC 52 ms
30,080 KB
testcase_03 AC 55 ms
30,208 KB
testcase_04 AC 55 ms
30,700 KB
testcase_05 AC 64 ms
30,592 KB
testcase_06 AC 58 ms
30,720 KB
testcase_07 RE -
testcase_08 AC 98 ms
53,632 KB
testcase_09 AC 99 ms
53,484 KB
testcase_10 AC 95 ms
53,376 KB
testcase_11 AC 97 ms
53,504 KB
testcase_12 AC 97 ms
53,376 KB
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 AC 139 ms
50,424 KB
testcase_20 RE -
testcase_21 RE -
testcase_22 AC 142 ms
50,560 KB
testcase_23 AC 172 ms
49,792 KB
testcase_24 AC 178 ms
49,920 KB
testcase_25 AC 188 ms
50,048 KB
testcase_26 AC 174 ms
49,920 KB
testcase_27 AC 174 ms
50,148 KB
testcase_28 AC 156 ms
50,048 KB
testcase_29 AC 55 ms
29,824 KB
testcase_30 AC 54 ms
192,392 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (133 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 FactorialExtensions
{
    static ModInt[] fac = Array.Empty<ModInt>();
    static ModInt[] inv = Array.Empty<ModInt>();
    const uint Capacity = 1 << 24;
    
    static void Resize(uint n)
    {
        if (n < fac.Length) return;
        var s = 1;
        while (s < n && s < Capacity) s <<= 1;
        fac = new ModInt[s + 1];
        fac[0] = 1;
        for (var i = 1; i <= s; i++) fac[i] = fac[i - 1] * i;
        inv = new ModInt[s + 1];
        inv[s] = fac[0] / fac[s];
        for (var i = s; i > 0; i--) inv[i - 1] = inv[i] * i;
    }

    public static ModInt Factorial(this int n) { Resize((uint)Math.Abs(n)); return n < 0 ? inv[-n] : fac[n]; }

    public static ModInt C(this int n, int r)
    {
        if (r < 0 || n < r) return 0;
        if (n <= Capacity) return Factorial(n) * Factorial(r - n) * Factorial(-r);
        if (n - r < r) return C(n, n - r);
        ModInt res = 1;
        for (var i = n; i > n - r; i--) res *= i;
        return res * Factorial(-r);
    }
    public static ModInt P(this int n, int r) => C(n, r) * Factorial(r);
    public static ModInt H(this int n, int r) => C(n + r - 1, r);
}

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 vz = new int[n];
        if (az[0] < 0) vz[0] = 1;
        for (var i = 1; i < n; i++)
        {
            var a = az[i];
            vz[i] = vz[i - 1];
            if (a < 0) vz[i]++;
        }
        var ra = (n + 1).Repeat(() => -1);
        for (var i = 0; i < n; i++)
        {
            var a = az[i];
            if (a >= 1) ra[a] = i;
        }
        ModInt ans = 0;
        var mj = n;
        var sz = vz[n - 1];
        var gz = 0;
        var tv = vz[n - 1];
        for (var i = n; i > 0; i--)
        {
            var j = ra[i];
            if (j >= 0)
            {
                if (mj <= j) continue;
                mj = j;
                ans += sz.Factorial() * gz.Factorial() * (tv - vz[j]).C(gz);
            }
            else
            {
                var v = 0;
                if (mj < n) v = tv - vz[mj - 1];
                sz--;
                ans += (tv.C(gz + 1) - v.C(gz + 1)) * gz.Factorial() * sz.Factorial();
                gz++;
            }
        }
        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()!.Trim().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();
    }
}
0