結果

問題 No.2964 Obstruction Bingo
ユーザー tobisatistobisatis
提出日時 2024-11-16 16:32:33
言語 C#
(.NET 8.0.404)
結果
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
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 49
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /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();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0