結果

問題 No.2961 Shiny Monster Master
ユーザー tobisatistobisatis
提出日時 2024-11-16 16:04:48
言語 C#
(.NET 8.0.203)
結果
WA  
実行時間 -
コード長 4,408 bytes
コンパイル時間 7,832 ms
コンパイル使用メモリ 167,080 KB
実行使用メモリ 215,912 KB
最終ジャッジ日時 2024-11-16 16:05:05
合計ジャッジ時間 16,286 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
29,312 KB
testcase_01 AC 53 ms
29,312 KB
testcase_02 AC 53 ms
29,040 KB
testcase_03 AC 55 ms
29,312 KB
testcase_04 AC 51 ms
28,792 KB
testcase_05 AC 84 ms
43,776 KB
testcase_06 AC 80 ms
45,600 KB
testcase_07 AC 87 ms
45,952 KB
testcase_08 AC 100 ms
52,480 KB
testcase_09 AC 69 ms
34,432 KB
testcase_10 AC 99 ms
53,504 KB
testcase_11 AC 91 ms
48,360 KB
testcase_12 AC 87 ms
48,128 KB
testcase_13 AC 64 ms
32,128 KB
testcase_14 AC 92 ms
52,096 KB
testcase_15 AC 88 ms
45,312 KB
testcase_16 AC 80 ms
43,776 KB
testcase_17 AC 85 ms
40,960 KB
testcase_18 AC 91 ms
46,988 KB
testcase_19 AC 92 ms
47,776 KB
testcase_20 AC 95 ms
51,920 KB
testcase_21 AC 97 ms
52,700 KB
testcase_22 AC 72 ms
35,908 KB
testcase_23 AC 90 ms
43,776 KB
testcase_24 AC 74 ms
35,412 KB
testcase_25 AC 90 ms
49,280 KB
testcase_26 AC 100 ms
49,920 KB
testcase_27 AC 85 ms
43,264 KB
testcase_28 AC 87 ms
45,584 KB
testcase_29 AC 78 ms
40,592 KB
testcase_30 AC 96 ms
54,208 KB
testcase_31 AC 89 ms
47,712 KB
testcase_32 AC 91 ms
48,512 KB
testcase_33 AC 98 ms
53,376 KB
testcase_34 AC 83 ms
46,208 KB
testcase_35 AC 97 ms
52,992 KB
testcase_36 AC 83 ms
44,400 KB
testcase_37 AC 90 ms
47,232 KB
testcase_38 AC 80 ms
43,120 KB
testcase_39 AC 88 ms
48,248 KB
testcase_40 AC 82 ms
43,008 KB
testcase_41 AC 71 ms
37,176 KB
testcase_42 AC 92 ms
48,680 KB
testcase_43 AC 70 ms
36,352 KB
testcase_44 AC 94 ms
49,920 KB
testcase_45 AC 51 ms
29,312 KB
testcase_46 AC 76 ms
37,632 KB
testcase_47 AC 90 ms
51,876 KB
testcase_48 AC 83 ms
46,336 KB
testcase_49 AC 85 ms
40,264 KB
testcase_50 AC 94 ms
50,392 KB
testcase_51 AC 77 ms
39,616 KB
testcase_52 AC 83 ms
43,072 KB
testcase_53 AC 82 ms
42,904 KB
testcase_54 AC 68 ms
34,432 KB
testcase_55 AC 91 ms
51,840 KB
testcase_56 AC 94 ms
47,744 KB
testcase_57 AC 85 ms
43,392 KB
testcase_58 AC 83 ms
43,552 KB
testcase_59 AC 87 ms
48,640 KB
testcase_60 AC 73 ms
41,264 KB
testcase_61 AC 82 ms
41,728 KB
testcase_62 AC 97 ms
56,192 KB
testcase_63 AC 90 ms
51,456 KB
testcase_64 AC 73 ms
39,680 KB
testcase_65 AC 95 ms
50,560 KB
testcase_66 AC 53 ms
29,312 KB
testcase_67 WA -
testcase_68 WA -
testcase_69 AC 49 ms
29,312 KB
testcase_70 WA -
testcase_71 AC 54 ms
29,184 KB
testcase_72 AC 52 ms
29,312 KB
testcase_73 WA -
testcase_74 AC 103 ms
56,960 KB
testcase_75 AC 104 ms
56,884 KB
testcase_76 AC 109 ms
215,912 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (92 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];
        var q = Int();
        var ans = new long[q];
        for (var i = 0; i < q; i++)
        {
            var ins = 0L;
            long u = Int() - 1;
            long v = Int();
            ins += v / r * n;
            ins -= u / r * n;
            u %= r;
            v %= r;
            if (u > v)
            {
                v += r;
                ins -= n;
            }
            if (v > 0) ins += cz[v];
            if (u > 0) ins -= cz[u];
            ans[i] = ins;
        }
        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