結果

問題 No.2961 Shiny Monster Master
ユーザー tobisatistobisatis
提出日時 2024-11-16 16:08:39
言語 C#
(.NET 8.0.203)
結果
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
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
29,036 KB
testcase_01 AC 53 ms
29,180 KB
testcase_02 AC 52 ms
29,180 KB
testcase_03 AC 54 ms
29,568 KB
testcase_04 AC 53 ms
29,056 KB
testcase_05 AC 85 ms
43,764 KB
testcase_06 AC 82 ms
45,864 KB
testcase_07 AC 87 ms
45,564 KB
testcase_08 AC 96 ms
52,544 KB
testcase_09 AC 70 ms
34,372 KB
testcase_10 AC 101 ms
53,888 KB
testcase_11 AC 90 ms
48,512 KB
testcase_12 AC 89 ms
48,256 KB
testcase_13 AC 68 ms
31,724 KB
testcase_14 AC 94 ms
52,480 KB
testcase_15 AC 90 ms
45,428 KB
testcase_16 AC 80 ms
43,756 KB
testcase_17 AC 84 ms
41,216 KB
testcase_18 AC 95 ms
47,488 KB
testcase_19 AC 95 ms
47,740 KB
testcase_20 AC 96 ms
51,920 KB
testcase_21 AC 96 ms
52,444 KB
testcase_22 AC 75 ms
35,688 KB
testcase_23 AC 86 ms
43,492 KB
testcase_24 AC 76 ms
35,840 KB
testcase_25 AC 92 ms
49,148 KB
testcase_26 AC 94 ms
49,796 KB
testcase_27 AC 84 ms
43,264 KB
testcase_28 AC 85 ms
45,740 KB
testcase_29 AC 78 ms
40,344 KB
testcase_30 AC 97 ms
54,016 KB
testcase_31 AC 89 ms
47,732 KB
testcase_32 AC 90 ms
48,384 KB
testcase_33 AC 99 ms
53,376 KB
testcase_34 AC 85 ms
46,080 KB
testcase_35 AC 98 ms
53,160 KB
testcase_36 AC 81 ms
44,672 KB
testcase_37 AC 91 ms
47,388 KB
testcase_38 AC 82 ms
43,132 KB
testcase_39 AC 90 ms
48,384 KB
testcase_40 AC 87 ms
43,008 KB
testcase_41 AC 74 ms
37,176 KB
testcase_42 AC 102 ms
49,024 KB
testcase_43 AC 75 ms
36,096 KB
testcase_44 AC 97 ms
49,944 KB
testcase_45 AC 55 ms
29,184 KB
testcase_46 AC 94 ms
37,692 KB
testcase_47 AC 90 ms
51,712 KB
testcase_48 AC 78 ms
46,712 KB
testcase_49 AC 79 ms
40,320 KB
testcase_50 AC 93 ms
50,688 KB
testcase_51 AC 81 ms
39,296 KB
testcase_52 AC 85 ms
43,460 KB
testcase_53 AC 81 ms
43,136 KB
testcase_54 AC 71 ms
34,500 KB
testcase_55 AC 92 ms
51,328 KB
testcase_56 AC 94 ms
47,612 KB
testcase_57 AC 85 ms
43,264 KB
testcase_58 AC 101 ms
43,508 KB
testcase_59 AC 95 ms
48,520 KB
testcase_60 AC 84 ms
41,600 KB
testcase_61 AC 85 ms
41,536 KB
testcase_62 AC 103 ms
56,532 KB
testcase_63 AC 93 ms
51,712 KB
testcase_64 AC 80 ms
39,236 KB
testcase_65 AC 94 ms
50,080 KB
testcase_66 AC 53 ms
29,056 KB
testcase_67 AC 55 ms
29,440 KB
testcase_68 AC 54 ms
29,184 KB
testcase_69 AC 54 ms
29,568 KB
testcase_70 AC 55 ms
29,312 KB
testcase_71 AC 54 ms
29,044 KB
testcase_72 AC 57 ms
29,568 KB
testcase_73 AC 55 ms
29,180 KB
testcase_74 AC 103 ms
57,088 KB
testcase_75 AC 103 ms
57,216 KB
testcase_76 AC 103 ms
217,132 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /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/

ソースコード

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 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();
    }
}
0