結果

問題 No.3052 Increasing Sliding Window Minimum
コンテスト
ユーザー tobisatis
提出日時 2025-03-08 00:19:02
言語 C#
(.NET 8.0.404)
結果
WA  
実行時間 -
コード長 6,888 bytes
コンパイル時間 9,065 ms
コンパイル使用メモリ 170,924 KB
実行使用メモリ 83,620 KB
最終ジャッジ日時 2025-03-08 00:19:22
合計ジャッジ時間 14,823 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 1
other AC * 4 WA * 38
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (113 ミリ秒)。
  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 Run()
{
    var t = Int();
    for (var i = 0; i < t; i++) Out(Solve());
}

ModInt Solve()
{
    var n = Int();
    var az = n.Repeat(() => Int() - 1);
    var rz = n.Repeat(() => -1);
    for (var i = 0; i < n; i++)
    {
        var a = az[i];
        if (a >= 0) rz[a] = i;
    }
    var oz = new int[n + 1];
    for (var i = n; i > 0; i--) oz[i - 1] = oz[i] + (rz[i - 1] >= 0 ? 1 : 0);
    var dp = new ModInt[n + 1, n + 1];
    dp[0, 0] = 1;
    for (var i = 0; i < n; i++)
    {
        var k = rz[i];
        for (var j = i; j <= n - 3; j++)
        {
            var v = dp[i, j];
            if (v == 0 || k > j + 1) continue;
            if (k < 0)
            {
                if (rz[j] < 0) dp[i + 1, j + 1] += v;
                if (rz[j + 1] < 0) dp[i + 1, j + 2] += v;
            }
            else if (k < j) dp[i + 1, j] += v;
            else
            {
                if (k == j) dp[i + 1, j + 1] += v;
                if (k == j + 1) dp[i + 1, j + 2] += v;
            }
        }
    }
    ModInt res = 0;
    for (var i = 0; i <= n; i++)
    {
        var v = n - i - oz[i];
        // res += dp[i, n] * v.Factorial();
        if (n - 1 < 0) continue;
        res += dp[i, n - 1] * v.Factorial();
        if (n - 2 < 0) continue;
        res += dp[i, n - 2] * v.Factorial();
    }
    return res;
}

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

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

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 = null)
    {
        if (x == null) return;
        separator ??= Environment.NewLine;
        if (x is System.Collections.IEnumerable a and not string)
        {
            var objects = a.Cast<object>();
            if (separator == Environment.NewLine && !objects.Any()) return;
            x = string.Join(separator, objects);
        }
        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
{
    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 AdditiveInverse()
    {
        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 MultiplicativeInverse()
    {
        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.MultiplicativeInverse();

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

static class FactorialExtensions
{
    public static ModInt Factorial(this int value)
    {
        Extend(value);
        return value < 0 ? _inv.Span[-value] : _fac.Span[value];
    }
    public static ModInt P(this int n, int r)
    {
        if (r < 0 || r > n) return 0;
        if (n <= MaxN) return Factorial(n) * Factorial(r - n);
        ModInt res = 1;
        for (var i = 0; i < r; i++) res *= n - i;
        return res;
    }
    public static ModInt C(this int n, int r)
    {
        if (r < 0 || r > n) return 0;
        r = Math.Min(r, n - r);
        return P(n, r) * Factorial(-r);
    }
    public static ModInt H(this int n, int r) => C(r + n - 1, r);

    public static ModInt ModIntInverse(this int n)
    {
        if (n == 0) throw new DivideByZeroException();
        if (n < 0) return ModIntInverse(-n).AdditiveInverse();
        if (n > MaxN) return ((ModInt)n).MultiplicativeInverse();
        return Factorial(n - 1) * Factorial(-n);
    }

    // [x^k](1-x)^-n = nHk
    public static ModInt[] NegativeBinomialSeries(long n, int m)
    {
        var res = new ModInt[m + 1];
        res[0] = 1;
        for (var i = 1; i <= m; i++) res[i] = res[i - 1] * (n - 1 + i) * ModIntInverse(i);
        return res;
    }

    const int MaxN = (1 << 24) - 1;
    static Memory<ModInt> _fac = new ModInt[]{ 1 };
    static Memory<ModInt> _inv = new ModInt[]{ 1 };
    static void Extend(int q)
    {
        var l = _fac.Length;
        if (q < 0) q = -q;
        if (q < l || MaxN < q) return;
        while (l <= q) l <<= 6;
        var fac = new ModInt[l];
        var inv = new ModInt[l];
        var sf = fac.AsSpan();
        sf[0] = 1;
        for (var i = 1; i < sf.Length; i++) sf[i] = sf[i - 1] * i;
        var si = inv.AsSpan();
        si[l - 1] = sf[l - 1].Power(-1);
        for (var i = si.Length - 1; i > 0; i--) si[i - 1] = si[i] * i;
        (_fac, _inv) = (fac, inv);
    }
}
0