結果

問題 No.2866 yuusaan's Knapsack
ユーザー tobisatis
提出日時 2024-08-30 21:54:10
言語 C#
(.NET 8.0.404)
結果
AC  
実行時間 85 ms / 2,000 ms
コード長 4,838 bytes
コンパイル時間 13,261 ms
コンパイル使用メモリ 166,612 KB
実行使用メモリ 197,932 KB
最終ジャッジ日時 2024-09-26 14:35:42
合計ジャッジ時間 12,131 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (90 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 wMax = Int();
        var l = 10000;
        var bz = new (int, int)[n];
        for (var i = 0; i < n; i++)
        {
            var v = Int();
            var w = Int();
            bz[i] = (w, v);
        }
        Array.Sort(bz);
        var z = l + 1 + Math.Max(0, wMax);
        var dp = new (int, ModInt)[z];
        var min = int.MinValue / 2;
        for (var i = 0; i < z; i++) dp[i].Item1 = min;
        dp[l] = (0, 1);
        foreach (var (w, v) in bz)
        {
            var ep = dp.AsSpan().ToArray();
            for (var i = 0; i < z; i++)
            {
                var (cv, ck) = dp[i];
                var nv = cv + v;
                var nw = i + w;
                if (nw < 0 || z <= nw) continue;
                var (ev, ek) = ep[nw];
                if (nv > ev) ep[nw] = (nv, ck);
                if (nv == ev) ep[nw] = (nv, ck + ek);
            }
            dp = ep;
        }
        var mv = int.MinValue;
        var vta = new Dictionary<int, ModInt>();
        for (var i = 0; i <= wMax + l; i++)
        {
            var (v, k) = dp[i];
            if (vta.TryGetValue(v, out var s)) vta[v] = s + k;
            else vta[v] = k;
            mv = Math.Max(mv, v);
        }
        return mv + " " + vta[mv];
    }

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