結果
問題 | No.2625 Bouns Ai |
ユーザー | tobisatis |
提出日時 | 2024-02-09 22:47:55 |
言語 | C# (.NET 8.0.203) |
結果 |
AC
|
実行時間 | 285 ms / 2,000 ms |
コード長 | 4,833 bytes |
コンパイル時間 | 7,076 ms |
コンパイル使用メモリ | 156,824 KB |
実行使用メモリ | 184,736 KB |
最終ジャッジ日時 | 2024-02-09 22:48:11 |
合計ジャッジ時間 | 11,652 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
34,468 KB |
testcase_01 | AC | 70 ms
33,956 KB |
testcase_02 | AC | 78 ms
37,028 KB |
testcase_03 | AC | 145 ms
37,156 KB |
testcase_04 | AC | 231 ms
37,284 KB |
testcase_05 | AC | 148 ms
37,156 KB |
testcase_06 | AC | 146 ms
37,156 KB |
testcase_07 | AC | 167 ms
37,156 KB |
testcase_08 | AC | 145 ms
37,156 KB |
testcase_09 | AC | 64 ms
33,060 KB |
testcase_10 | AC | 221 ms
37,284 KB |
testcase_11 | AC | 69 ms
35,108 KB |
testcase_12 | AC | 221 ms
37,284 KB |
testcase_13 | AC | 195 ms
37,284 KB |
testcase_14 | AC | 238 ms
37,284 KB |
testcase_15 | AC | 219 ms
37,284 KB |
testcase_16 | AC | 217 ms
37,284 KB |
testcase_17 | AC | 285 ms
37,284 KB |
testcase_18 | AC | 216 ms
37,284 KB |
testcase_19 | AC | 239 ms
37,284 KB |
testcase_20 | AC | 214 ms
37,284 KB |
testcase_21 | AC | 218 ms
37,284 KB |
testcase_22 | AC | 192 ms
37,284 KB |
testcase_23 | AC | 200 ms
37,284 KB |
testcase_24 | AC | 196 ms
37,284 KB |
testcase_25 | AC | 207 ms
184,736 KB |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (100 ms)。 MSBuild のバージョン 17.7.3+8ec440e68 (.NET) main -> /home/judge/data/code/bin/Release/net7.0/main.dll main -> /home/judge/data/code/bin/Release/net7.0/publish/
ソースコード
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 az = n.Repeat(Int); var max = 100000; var bc = 0; var mz = new int[n]; mz[0] = az[0]; for (var i = 1; i < n; i++) { var a = az[i]; var ap = az[i - 1]; if (ap >= a) { mz[i] = mz[i - 1]; bc += ap - a; } else { mz[i] = bc + a; } if (mz[i] > max) return 0; } var dp = new ModInt[max + 1]; var sp = new ModInt[max + 1]; for (var i = mz[0]; i <= max; i++) dp[i] = 1; sp[0] = dp[0]; for (var i = 1; i <= max; i++) sp[i] = dp[i] + sp[i - 1]; for (var i = 1; i < n; i++) { var ep = new ModInt[max + 1]; var m = mz[i]; var d = m - mz[i - 1]; for (var j = d; j <= max; j++) { ep[j] += sp[j - d]; } var tp = new ModInt[max + 1]; tp[0] = ep[0]; for (var j = 1; j <= max; j++) tp[j] = ep[j] + tp[j - 1]; (dp, sp) = (ep, tp); } var ans = sp[max]; 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 }; #pragma warning disable IDE0051 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(); } #pragma warning restore IDE0051 }