結果

問題 No.2452 Incline
ユーザー PAKACHUPAKACHU
提出日時 2023-09-02 14:48:50
言語 C++17(clang)
(17.0.6 + boost 1.83.0)
結果
AC  
実行時間 464 ms / 2,000 ms
コード長 3,907 bytes
コンパイル時間 3,118 ms
コンパイル使用メモリ 165,356 KB
実行使用メモリ 18,880 KB
最終ジャッジ日時 2024-06-11 21:23:19
合計ジャッジ時間 7,069 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 34 ms
18,840 KB
testcase_01 AC 31 ms
18,764 KB
testcase_02 AC 32 ms
18,844 KB
testcase_03 AC 464 ms
18,816 KB
testcase_04 AC 395 ms
18,816 KB
testcase_05 AC 373 ms
18,780 KB
testcase_06 AC 406 ms
18,880 KB
testcase_07 AC 377 ms
18,800 KB
testcase_08 AC 306 ms
18,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, 1, 0, -1, 1, -1, 1, -1 };
const long long mod = 998244353;
const ll inf = 1LL << 60;
const int INF = 5e8;

template <int MOD>
struct ModInt {
    static const int Mod = MOD;
    unsigned x;
    ModInt()
        : x(0)
    {
    }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt& operator+=(ModInt that)
    {
        if ((x += that.x) >= MOD)
            x -= MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that)
    {
        if ((x += MOD - that.x) >= MOD)
            x -= MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that)
    {
        x = (unsigned long long)x * that.x % MOD;
        return *this;
    }
    ModInt& operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const
    {
        long long a = x, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            std::swap(a, b);
            u -= t * v;
            std::swap(u, v);
        }
        return ModInt(u);
    }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const
    {
        ModInt t;
        t.x = x == 0 ? 0 : Mod - x;
        return t;
    }
};
template <int MOD>
ostream& operator<<(ostream& st, const ModInt<MOD> a)
{
    st << a.get();
    return st;
};
template <int MOD>
ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k)
{
    ModInt<MOD> r = 1;
    while (k) {
        if (k & 1)
            r *= a;
        a *= a;
        k >>= 1;
    }
    return r;
}

template <typename T, int FAC_MAX>
struct Comb {
    vector<T> fac, ifac;
    Comb()
    {
        fac.resize(FAC_MAX, 1);
        ifac.resize(FAC_MAX, 1);
        for (int i = 1; i < FAC_MAX; i++)
            fac[i] = fac[i - 1] * i;
        ifac[FAC_MAX - 1] = T(1) / fac[FAC_MAX - 1];
        for (int i = FAC_MAX - 2; i >= 1; i--)
            ifac[i] = ifac[i + 1] * T(i + 1);
    }
    T aPb(int a, int b)
    {
        if (b < 0 || a < b)
            return T(0);
        return fac[a] * ifac[a - b];
    }
    T aCb(int a, int b)
    {
        if (b < 0 || a < b)
            return T(0);
        return fac[a] * ifac[a - b] * ifac[b];
    }
    T nHk(int n, int k)
    {
        if (n == 0 && k == 0)
            return T(1);
        if (n <= 0 || k < 0)
            return 0;
        return aCb(n + k - 1, k);
    }
};
typedef ModInt<998244353> mint;
Comb<mint, 2000009> comb;

void solve()
{
    ll n, m, l, r;
    cin >> n >> m >> l >> r;

    mint ans = r - l + 1;
    if (r >= 1) {
        ll q = r / (n - 1);
        ll p = r % (n - 1);
        ans += (mint)q * (q - 1) / 2 * (n - 1) + q * (p + 1);
    }
    if (l - 1 >= 1) {
        ll q = (l - 1) / (n - 1);
        ll p = (l - 1) % (n - 1);
        ans -= (mint)q * (q - 1) / 2 * (n - 1) + q * (p + 1);
    }

    if (m - l >= 1) {
        ll q = (m - l) / (n - 1);
        ll p = (m - l) % (n - 1);
        ans += (mint)q * (q - 1) / 2 * (n - 1) + q * (p + 1);
    }

    if (m - r - 1 >= 1) {
        ll q = (m - r - 1) / (n - 1);
        ll p = (m - r - 1) % (n - 1);
        ans -= (mint)q * (q - 1) / 2 * (n - 1) + q * (p + 1);
    }

    cout << ans << endl;
}

int main()
{
    int t;
    cin >> t;
    while (t--)
        solve();
}
0