結果
問題 | No.802 だいたい等差数列 |
ユーザー | Sumitacchan |
提出日時 | 2019-03-17 23:01:13 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 86 ms / 2,000 ms |
コード長 | 3,463 bytes |
コンパイル時間 | 1,403 ms |
コンパイル使用メモリ | 161,532 KB |
実行使用メモリ | 25,780 KB |
最終ジャッジ日時 | 2024-07-08 01:42:17 |
合計ジャッジ時間 | 3,095 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 48 ms
19,648 KB |
testcase_11 | AC | 66 ms
25,332 KB |
testcase_12 | AC | 38 ms
14,472 KB |
testcase_13 | AC | 62 ms
24,488 KB |
testcase_14 | AC | 52 ms
19,280 KB |
testcase_15 | AC | 32 ms
11,416 KB |
testcase_16 | AC | 52 ms
19,996 KB |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 44 ms
16,216 KB |
testcase_20 | AC | 74 ms
21,132 KB |
testcase_21 | AC | 86 ms
25,780 KB |
testcase_22 | AC | 65 ms
25,776 KB |
testcase_23 | AC | 36 ms
11,576 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 25 ms
10,152 KB |
testcase_27 | AC | 11 ms
6,912 KB |
testcase_28 | AC | 44 ms
14,640 KB |
testcase_29 | AC | 86 ms
25,776 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 2 ms
5,376 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | AC | 19 ms
9,600 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;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);i++)#define REP(i, n) FOR(i,0,n)#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)#define IREP(i, n) IFOR(i,0,n)#define Sort(v) sort(v.begin(), v.end())#define Reverse(v) reverse(v.begin(), v.end())#define all(v) v.begin(),v.end()#define SZ(v) ((int)v.size())#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))#define Max(a, b) a = max(a, b)#define Min(a, b) a = min(a, b)#define bit(n) (1LL<<(n))#define Ans(f, y, n) if(f) cout << y << endl; else cout << n << endl;#define debug(x) cout << #x << "=" << x << endl;#define vdebug(v) cout << #v << "=" << endl; REP(i, v.size()){ cout << v[i] << ","; } cout << endl;#define mdebug(m) cout << #m << "=" << endl; REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;}#define pb push_back#define f first#define s second#define int long long#define INF 1000000000000000000using vec = vector<int>;using mat = vector<vec>;using Pii = pair<int, int>;using PiP = pair<int, Pii>;using PPi = pair<Pii, int>;using bools = vector<bool>;using pairs = vector<Pii>;template<typename T> void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }void readv_m1(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }//int dx[4] = {1,0,-1,0};//int dy[4] = {0,1,0,-1};int mod = 1000000007;//int mod = 998244353;#define Add(x, y) x = (x + (y)) % mod#define Mult(x, y) x = (x * (y)) % modint modpow(int x, int n, int m){int a = 1;IREP(i, 64){a = (a * a) % m;if(((n >> i) & 1) == 1) a = (a * x) % m;}return a;}class Combination{public:vec fact, invfact;int MAX_N, mod;Combination(int MAX_N, int mod): MAX_N(MAX_N), mod(mod) {initialize();}void initialize(){fact = vec(MAX_N + 1);invfact = vec(MAX_N + 1);fact[0] = 1;FOR(i, 1, MAX_N + 1){fact[i] = (fact[i - 1] * i) % mod;}invfact[MAX_N] = modpow(fact[MAX_N], mod - 2, mod);IREP(i, MAX_N){invfact[i] = (invfact[i + 1] * (i + 1)) % mod;}}int nCr(int n, int r){if(r > n || r < 0 || n < 0) return 0;if(n > MAX_N){MAX_N = n;initialize();}int a = fact[n];a = (a * invfact[r]) % mod;a = (a * invfact[n - r]) % mod;return a;}int nPr(int n, int r){if(r > n || r < 0 || n < 0) return 0;if(n > MAX_N){MAX_N = n;initialize();}int a = fact[n];a = (a * invfact[n - r]) % mod;return a;}};signed main(){int N, M, D1, D2; cin >> N >> M >> D1 >> D2;M -= 1;M -= D1 * (N - 1);D2 -= D1;if(M < 0){cout << 0 << endl;return 0;}Combination C(N, mod);int ans = 0;REP(i, N){if(M < i * (D2 + 1)) break;int c1 = C.nCr(N - 1, i);int m = M - i * (D2 + 1);int tmp = (c1 * C.nCr(m + N, N)) % mod;if(i % 2) ans = (ans - tmp + mod) % mod;else ans = (ans + tmp) % mod;}cout << ans << endl;return 0;}