結果

問題 No.802 だいたい等差数列
ユーザー 👑 hitonanodehitonanode
提出日時 2019-08-25 15:08:59
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 123 ms / 2,000 ms
コード長 4,965 bytes
コンパイル時間 1,701 ms
コンパイル使用メモリ 168,448 KB
実行使用メモリ 50,280 KB
最終ジャッジ日時 2024-04-24 09:20:06
合計ジャッジ時間 6,788 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 112 ms
49,968 KB
testcase_01 AC 108 ms
50,176 KB
testcase_02 AC 109 ms
50,156 KB
testcase_03 AC 108 ms
50,068 KB
testcase_04 AC 110 ms
50,080 KB
testcase_05 AC 109 ms
49,980 KB
testcase_06 AC 105 ms
49,976 KB
testcase_07 AC 107 ms
50,072 KB
testcase_08 AC 114 ms
50,244 KB
testcase_09 AC 103 ms
50,144 KB
testcase_10 AC 110 ms
50,068 KB
testcase_11 AC 107 ms
50,048 KB
testcase_12 AC 112 ms
50,120 KB
testcase_13 AC 114 ms
50,080 KB
testcase_14 AC 115 ms
50,048 KB
testcase_15 AC 123 ms
50,068 KB
testcase_16 AC 113 ms
50,136 KB
testcase_17 AC 108 ms
50,140 KB
testcase_18 AC 113 ms
50,156 KB
testcase_19 AC 118 ms
50,048 KB
testcase_20 AC 120 ms
50,176 KB
testcase_21 AC 117 ms
50,176 KB
testcase_22 AC 116 ms
50,056 KB
testcase_23 AC 118 ms
50,280 KB
testcase_24 AC 111 ms
50,072 KB
testcase_25 AC 107 ms
50,096 KB
testcase_26 AC 103 ms
50,072 KB
testcase_27 AC 108 ms
50,156 KB
testcase_28 AC 123 ms
50,132 KB
testcase_29 AC 113 ms
50,060 KB
testcase_30 AC 113 ms
50,144 KB
testcase_31 AC 113 ms
50,044 KB
testcase_32 AC 112 ms
50,064 KB
testcase_33 AC 117 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 ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#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> 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); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
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; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

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(lint n, lint 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;
}
lint nPr(int n, int r)
{
    if (n<r || r<0) return 0;
    if (n >= (int)fac.size()) facInit(n);
    return fac[n] * facInv[n-r] % MOD;
}
lint power(lint x, lint n, lint mod=MOD)
{
    lint ans = 1;
    while (n>0)
    {
        if (n & 1) (ans *= x) %= mod;
        (x *= x) %= mod;
       n >>= 1;
    }
   return ans;
}
lint doublefac(lint n)
{
    if (n < 0) return 0;
    lint k = (n + 1) / 2;
    if (n & 1) return fac[k * 2] * power(facInv[2], k) % MOD * power(fac[k], MOD - 2) % MOD;
    else return fac[k] * power(facInv[2], k) % MOD;
}
lint solve(int N, lint M, lint D)
{
    if (M < 0) return 0;
    lint ret = 0;
    REP(bad, N)
    {
        lint tmp = nCr(M - 1 - bad * (D + 1) + N, N) * nCr(N - 1, bad) % MOD;
        if (bad % 2) ret -= tmp;
        else ret += tmp;
    }
    return (ret % MOD + MOD) % MOD;
}
int main()
{
    facInit(2000000);
    int N, M, D1, D2;
    cin >> N >> M >> D1 >> D2;
    cout << solve(N, M - 1LL * D1 * (N - 1), D2 - D1) << endl;
}
0