結果
問題 | No.2961 Shiny Monster Master |
ユーザー |
|
提出日時 | 2024-11-16 16:08:39 |
言語 | C# (.NET 8.0.404) |
結果 |
AC
|
実行時間 | 103 ms / 1,777 ms |
コード長 | 4,164 bytes |
コンパイル時間 | 8,507 ms |
コンパイル使用メモリ | 164,944 KB |
実行使用メモリ | 217,132 KB |
最終ジャッジ日時 | 2024-11-16 16:09:01 |
合計ジャッジ時間 | 17,374 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 77 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (96 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/
ソースコード
namespace AtCoder;#nullable enableusing 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 r = Int();var n = Int();var cz = new long[r * 2];for (var i = 0; i < n; i++){var a = Int();cz[a]++;cz[a + r]++;}for (var i = 1; i < r * 2; i++) cz[i] += cz[i - 1];long F(long x) => x / r * n + cz[x % r];var q = Int();var ans = new long[q];for (var i = 0; i < q; i++){long u = Int() - 1;long v = Int();ans[i] = F(v) - F(u);}Out(ans);return null;}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();}}