結果

問題 No.2772 Appearing Even Times
ユーザー tobisatistobisatis
提出日時 2024-05-31 23:18:06
言語 C#
(.NET 8.0.404)
結果
AC  
実行時間 1,313 ms / 4,000 ms
コード長 4,761 bytes
コンパイル時間 9,979 ms
コンパイル使用メモリ 168,988 KB
実行使用メモリ 215,344 KB
最終ジャッジ日時 2024-12-21 01:36:16
合計ジャッジ時間 27,045 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (108 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();
public static int ToFlag(this int i)
{
if (i < 0 || 31 <= i) throw new IndexOutOfRangeException();
return 1 << i;
}
public static bool OfFlag(this int value, int i) => (value & ToFlag(i)) > 0;
public static int WithFlag(this int value, int i, bool f) => f ? (value | ToFlag(i)) : (value & ~ToFlag(i));
}
class AtCoder
{
object? Solve()
{
var n = String();
var l = n.Length;
var b = 10.ToFlag();
int u;
var dp = new ModInt[b];
{
var n0 = n[0] - '0';
for (var i = 1; i < n0; i++) dp[i.ToFlag()] += 1;
u = n0.ToFlag();
}
for (var digit = 1; digit < l; digit++)
{
var ni = n[digit] - '0';
var ep = new ModInt[b];
for (var i = 0; i < b; i++)
{
var v = dp[i];
for (var j = 0; j < 10; j++) ep[i.WithFlag(j, !i.OfFlag(j))] += v;
}
for (var i = 1; i < 10; i++) ep[i.ToFlag()] += 1;
for (var i = 0; i < ni; i++) ep[i.ToFlag() ^ u] += 1;
dp = ep;
u = u.WithFlag(ni, !u.OfFlag(ni));
}
ModInt ans = dp[0];
if (u == 0) ans += 1;
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()!.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