結果
問題 | No.802 だいたい等差数列 |
ユーザー | otera |
提出日時 | 2022-05-02 19:06:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 7,594 bytes |
コンパイル時間 | 2,322 ms |
コンパイル使用メモリ | 208,380 KB |
実行使用メモリ | 817,536 KB |
最終ジャッジ日時 | 2024-07-01 23:06:17 |
合計ジャッジ時間 | 6,178 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | AC | 30 ms
13,824 KB |
testcase_15 | AC | 16 ms
8,960 KB |
testcase_16 | AC | 28 ms
14,336 KB |
testcase_17 | AC | 12 ms
6,784 KB |
testcase_18 | AC | 10 ms
6,144 KB |
testcase_19 | AC | 23 ms
11,464 KB |
testcase_20 | AC | 31 ms
14,976 KB |
testcase_21 | AC | 40 ms
18,432 KB |
testcase_22 | RE | - |
testcase_23 | AC | 15 ms
7,808 KB |
testcase_24 | MLE | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
ソースコード
/** * author: otera **/ #include<bits/stdc++.h> #ifndef OTERA_MODINT #define OTERA_MODINT 1 #include<atcoder/modint> namespace otera { using modint107 = atcoder::modint1000000007; using modint998 = atcoder::modint998244353; using modint = atcoder::modint; }; //namespace otera std::ostream& operator<<(std::ostream& out, const atcoder::modint1000000007 &e) { out << e.val(); return out; } std::ostream& operator<<(std::ostream& out, const atcoder::modint998244353 &e) { out << e.val(); return out; } std::ostream& operator<<(std::ostream& out, const atcoder::modint &e) { out << e.val(); return out; } #endif // OTERA_MODINT namespace otera{ template<typename T> class factorial { public: factorial() {} factorial(int n) { ensure(n); } T com(const int n, const int k) { if(n == k or k == 0) return 1; if(n < k or n < 0 or k < 0) return 0; ensure(n); return fact_[n] * finv_[k] * finv_[n - k]; } T fact(const int n) { if(n < 0) return 0; ensure(n); return fact_[n]; } T inv(const int n) { if(n < 0) return 0; ensure(n); return inv_[n]; } T finv(const int n) { if(n < 0) return 0; ensure(n); return finv_[n]; } private: static std::vector<T> fact_, inv_, finv_; int MOD = T::mod(); void ensure(const int n) { int sz = fact_.size(); if(n + 1 <= sz) return; int next_sz = std::max(n + 1, sz * 2); fact_.resize(next_sz), inv_.resize(next_sz), finv_.resize(next_sz); for(int i = sz; i < next_sz; ++ i) { fact_[i] = fact_[i - 1] * i; inv_[i] = -inv_[MOD % i] * (MOD / i); finv_[i] = finv_[i - 1] * inv_[i]; } } }; template<typename T> std::vector<T> factorial<T>::fact_ {1, 1}; template<typename T> std::vector<T> factorial<T>::inv_ {1, 1}; template<typename T> std::vector<T> factorial<T>::finv_ {1, 1}; } // namespace otera using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; using int128_t = __int128_t; #define repa(i, n) for(int i = 0; i < n; ++ i) #define repb(i, a, b) for(int i = a; i < b; ++ i) #define repc(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define overload3(a, b, c, d, ...) d #define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__) #define rep1a(i, n) for(int i = 0; i <= n; ++ i) #define rep1b(i, a, b) for(int i = a; i <= b; ++ i) #define rep1c(i, a, b, c) for(int i = a; i <= b; i += c) #define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__) #define rev_repa(i, n) for(int i=n-1;i>=0;i--) #define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--) #define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__) #define rev_rep1a(i, n) for(int i=n;i>=1;i--) #define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--) #define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__) typedef pair<int, int> P; typedef pair<ll, ll> LP; #define pb push_back #define pf push_front #define ppb pop_back #define ppf pop_front #define eb emplace_back #define fr first #define sc second #define all(c) c.begin(),c.end() #define rall(c) c.rbegin(), c.rend() #define lb(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define ub(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define Sort(a) sort(all(a)) #define Rev(a) reverse(all(a)) #define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a)) #define si(c) (int)(c).size() inline ll popcnt(ull a){ return __builtin_popcountll(a); } #define kth_bit(x, k) ((x>>k)&1) #define unless(A) if(!(A)) ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; } template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;in(__VA_ARGS__) #define vec(type,name,...) vector<type>name(__VA_ARGS__) #define VEC(type,name,size) vector<type>name(size);in(name) #define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__)) #define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name) #define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__))) template <class T> using vc = vector<T>; template <class T> using vvc = vector<vc<T>>; template <class T> using vvvc = vector<vvc<T>>; template <class T> using vvvvc = vector<vvvc<T>>; template <class T> using pq = priority_queue<T>; template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>; template <class T, class U> using umap = unordered_map<T, U>; template<class T> void scan(T& a){ cin >> a; } template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); } void in(){} template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); } void print(){ cout << ' '; } template<class T> void print(const T& a){ cout << a; } template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } } int out(){ cout << '\n'; return 0; } template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; } template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; } #define CHOOSE(a) CHOOSE2 a #define CHOOSE2(a0,a1,a2,a3,a4,x,...) x #define debug_1(x1) cout<<#x1<<": "<<x1<<endl #define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl #define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl #define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl #define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl #ifdef DEBUG #define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__) #define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); } #else #define debug(...) #define dump(...) #endif struct io_setup { io_setup(int precision = 20) { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(precision); } } io_setup_ {}; using mint = otera::modint107; otera::factorial<mint> bc; void solve() { INT(n, m); VEC(int, d, 2); int t = d[1] - d[0]; int sum = (m - 1) - (n - 1) * d[0]; debug(t, sum); mint ans = 0; for(int i = 0; i <= n - 1; ++ i) { mint val = bc.com(n - 1, i) * bc.com(sum - (t + 1) * i + n, n); if(i % 2 == 0) ans += val; else ans -= val; } out(ans); } signed main() { int testcase = 1; // in(testcase); while(testcase--) solve(); return 0; }