結果

問題 No.802 だいたい等差数列
ユーザー hitonanodehitonanode
提出日時 2019-03-17 22:47:20
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 3,979 bytes
コンパイル時間 1,680 ms
コンパイル使用メモリ 171,372 KB
実行使用メモリ 50,560 KB
最終ジャッジ日時 2024-07-08 01:08:14
合計ジャッジ時間 8,755 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 89 ms
50,048 KB
testcase_01 AC 89 ms
50,176 KB
testcase_02 AC 87 ms
50,176 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 86 ms
50,176 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 88 ms
50,048 KB
testcase_07 AC 88 ms
50,048 KB
testcase_08 AC 89 ms
50,048 KB
testcase_09 AC 89 ms
50,048 KB
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 AC 94 ms
50,304 KB
testcase_15 AC 90 ms
50,176 KB
testcase_16 AC 91 ms
50,048 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 90 ms
50,176 KB
testcase_20 AC 96 ms
50,176 KB
testcase_21 AC 94 ms
50,176 KB
testcase_22 RE -
testcase_23 AC 87 ms
50,236 KB
testcase_24 AC 7 ms
5,376 KB
testcase_25 AC 86 ms
50,176 KB
testcase_26 AC 91 ms
50,176 KB
testcase_27 RE -
testcase_28 AC 85 ms
50,156 KB
testcase_29 AC 91 ms
50,304 KB
testcase_30 AC 92 ms
50,304 KB
testcase_31 AC 87 ms
50,176 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 86 ms
50,176 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

constexpr lint MOD = 1000000007;
vector<lint> fac, facInv, inv;
void facInit(int nmax)
{
    fac = facInv = inv = vector<lint>(nmax + 1, 1);
    for (int i = 2; i <= nmax; i++)
    {
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        facInv[i] = facInv[i-1] * inv[i] % MOD;
    }
}
lint nCr(int n, int r)
{
    if (n<r || r<0) return 0;
    if (n >= (int)fac.size()) facInit(n);
    return (fac[n] * facInv[r] % MOD) * facInv[n-r] % MOD;
}

int main()
{
    lint N, M, D1, D2;
    cin >> N >> M >> D1 >> D2;
    M = M - (N - 1) * D1;
    D2 = D2 - D1;

    if (M < 1)
    {
        cout << 0 << endl;
        return 0;
    }

    facInit(2000000);
    lint ans = 0;
    REP(i, N) // 交差がD2より大きい地点の数
    {
        lint tmp = nCr(N - 1, i) * nCr(M - 1 + N - (D2 + 1) * i, N) % MOD;
        if (i % 2 == 0) ans += tmp; else ans += MOD - tmp;
    }
    cout << ans % MOD << endl;
}
0