結果

問題 No.2964 Obstruction Bingo
ユーザー tobisatistobisatis
提出日時 2024-11-16 16:32:33
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 2,057 ms / 2,468 ms
コード長 5,407 bytes
コンパイル時間 12,710 ms
コンパイル使用メモリ 166,944 KB
実行使用メモリ 211,008 KB
最終ジャッジ日時 2024-11-16 16:34:01
合計ジャッジ時間 66,980 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
31,104 KB
testcase_01 AC 67 ms
31,232 KB
testcase_02 AC 72 ms
32,128 KB
testcase_03 AC 67 ms
31,104 KB
testcase_04 AC 68 ms
30,824 KB
testcase_05 AC 80 ms
32,000 KB
testcase_06 AC 721 ms
38,656 KB
testcase_07 AC 136 ms
32,512 KB
testcase_08 AC 570 ms
36,864 KB
testcase_09 AC 114 ms
32,896 KB
testcase_10 AC 387 ms
34,924 KB
testcase_11 AC 518 ms
37,244 KB
testcase_12 AC 1,157 ms
42,880 KB
testcase_13 AC 214 ms
33,664 KB
testcase_14 AC 197 ms
33,132 KB
testcase_15 AC 93 ms
32,384 KB
testcase_16 AC 353 ms
35,048 KB
testcase_17 AC 287 ms
34,304 KB
testcase_18 AC 263 ms
33,896 KB
testcase_19 AC 453 ms
36,992 KB
testcase_20 AC 649 ms
37,760 KB
testcase_21 AC 1,514 ms
42,880 KB
testcase_22 AC 331 ms
35,968 KB
testcase_23 AC 169 ms
33,632 KB
testcase_24 AC 76 ms
32,256 KB
testcase_25 AC 2,057 ms
46,976 KB
testcase_26 AC 2,039 ms
47,104 KB
testcase_27 AC 2,053 ms
46,720 KB
testcase_28 AC 2,049 ms
47,104 KB
testcase_29 AC 2,051 ms
47,104 KB
testcase_30 AC 2,056 ms
47,232 KB
testcase_31 AC 2,037 ms
46,844 KB
testcase_32 AC 2,047 ms
47,104 KB
testcase_33 AC 2,051 ms
46,948 KB
testcase_34 AC 2,038 ms
47,232 KB
testcase_35 AC 2,043 ms
46,720 KB
testcase_36 AC 2,045 ms
47,232 KB
testcase_37 AC 2,046 ms
46,848 KB
testcase_38 AC 2,042 ms
46,976 KB
testcase_39 AC 2,054 ms
47,104 KB
testcase_40 AC 2,045 ms
47,232 KB
testcase_41 AC 2,038 ms
47,232 KB
testcase_42 AC 2,045 ms
47,104 KB
testcase_43 AC 2,057 ms
46,848 KB
testcase_44 AC 2,029 ms
47,104 KB
testcase_45 AC 155 ms
33,280 KB
testcase_46 AC 72 ms
31,976 KB
testcase_47 AC 73 ms
31,976 KB
testcase_48 AC 73 ms
33,792 KB
testcase_49 AC 186 ms
33,408 KB
testcase_50 AC 504 ms
36,736 KB
testcase_51 AC 1,897 ms
211,008 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (99 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;
    }

    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)
    {
        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 l = Int();
        var k = Int();
        var s = String().Select(c => c - 'a').ToArray();
        var t = String().Select(c => c - 'a').ToArray();
        var cz = 26.Repeat(Int);
        var rq = (ModInt)1 / cz.Sum();
        ModInt ap = 0;
        ModInt aq = 0;
        var dp = new ModInt[l, l, 3];
        dp[0, 0, 0] = 1;
        for (var lp = 1; lp <= k; lp++)
        {
            var ep = new ModInt[l, l, 3];
            for (var i = 0; i < l; i++) for (var j = 0; j < l; j++) for (var w = 0; w < 3; w++)
            {
                var v = dp[i, j, w];
                if (v == 0) continue;
                var (ki, kj) = (i, j);
                if (w == 1 && i < j) ki += l;
                if (w == 2 && i > j) kj += l;
                for (var c = 0; c < 26; c++)
                {
                    var nv = v * cz[c] * rq;
                    var (ni, nj) = (ki, kj);
                    if (s[i] == c) ni++;
                    if (t[j] == c) nj++;
                    if (ni - nj == l)
                    {
                        ap += nv;
                        continue;
                    }
                    if (nj - ni == l)
                    {
                        aq += nv;
                        continue;
                    }
                    var qi = ni % l;
                    var qj = nj % l;
                    if (ni > nj)
                    {
                        ep[qi, qj, 1] += nv;
                        continue;
                    }
                    if (nj > ni)
                    {
                        ep[qi, qj, 2] += nv;
                        continue;
                    }
                    ep[qi, qj, 0] += nv;
                }
            }
            dp = ep;
        }
        return ap + " " + aq;
    }

    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