結果

問題 No.2875 What is My Rank?
ユーザー tobisatistobisatis
提出日時 2024-09-06 22:51:42
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 248 ms / 2,000 ms
コード長 4,288 bytes
コンパイル時間 8,047 ms
コンパイル使用メモリ 165,368 KB
実行使用メモリ 216,932 KB
最終ジャッジ日時 2024-09-06 22:53:32
合計ジャッジ時間 14,235 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
30,040 KB
testcase_01 AC 58 ms
30,040 KB
testcase_02 AC 57 ms
30,040 KB
testcase_03 AC 57 ms
30,336 KB
testcase_04 AC 58 ms
30,336 KB
testcase_05 AC 57 ms
29,952 KB
testcase_06 AC 57 ms
30,464 KB
testcase_07 AC 57 ms
30,336 KB
testcase_08 AC 57 ms
30,208 KB
testcase_09 AC 235 ms
56,448 KB
testcase_10 AC 222 ms
56,408 KB
testcase_11 AC 208 ms
56,448 KB
testcase_12 AC 140 ms
44,416 KB
testcase_13 AC 141 ms
46,040 KB
testcase_14 AC 81 ms
35,072 KB
testcase_15 AC 166 ms
56,192 KB
testcase_16 AC 165 ms
55,936 KB
testcase_17 AC 142 ms
48,384 KB
testcase_18 AC 248 ms
56,320 KB
testcase_19 AC 178 ms
56,192 KB
testcase_20 AC 96 ms
38,528 KB
testcase_21 AC 93 ms
39,424 KB
testcase_22 AC 148 ms
47,232 KB
testcase_23 AC 161 ms
56,320 KB
testcase_24 AC 201 ms
56,320 KB
testcase_25 AC 133 ms
46,208 KB
testcase_26 AC 86 ms
37,248 KB
testcase_27 AC 118 ms
44,160 KB
testcase_28 AC 136 ms
43,516 KB
testcase_29 AC 162 ms
48,000 KB
testcase_30 AC 146 ms
48,256 KB
testcase_31 AC 74 ms
34,816 KB
testcase_32 AC 152 ms
55,808 KB
testcase_33 AC 163 ms
56,192 KB
testcase_34 AC 146 ms
216,932 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (93 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();
}

class AtCoder
{
    object? Solve()
    {
        var n = Int();
        var pz = n.Repeat(() => (Int(), Int()));
        ModInt ans = 0;
        var (l0, r0) = pz[0];
        var invd = (ModInt)1 / (r0 - l0 + 1);
        for (var i = 1; i < n; i++)
        {
            var (l, r) = pz[i];
            ModInt ins = 0;
            if (l > r0)
            {
                ans += 1;
                continue;
            }
            if (r < l0) continue;
            if (r > r0) ins += r - r0;
            long ml = Math.Max(l0, l) - l0 - 1;
            long mr = Math.Min(r0, r) - l0;
            if (mr >= 0) ins += mr * (mr + 1) / 2 * invd;
            if (ml >= 0) ins -= ml * (ml + 1) / 2 * invd;
            ans += ins / (r - l + 1);
        }
        return ans + 1;
    }

    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