結果
問題 | No.612 Move on grid |
ユーザー |
|
提出日時 | 2023-06-17 18:24:21 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 36 ms / 2,500 ms |
コード長 | 2,964 bytes |
コンパイル時間 | 1,587 ms |
コンパイル使用メモリ | 170,748 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-25 08:31:56 |
合計ジャッジ時間 | 2,732 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 17 |
ソースコード
#include <bits/stdc++.h>using namespace std;template<const unsigned int MOD> struct prime_modint {using mint = prime_modint;unsigned int v;prime_modint() : v(0) {}prime_modint(unsigned int a) { a %= MOD; v = a; }prime_modint(unsigned long long a) { a %= MOD; v = a; }prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }static constexpr int mod() { return MOD; }mint& operator++() {v++; if(v == MOD)v = 0; return *this;}mint& operator--() {if(v == 0)v = MOD; v--; return *this;}mint operator++(int) { mint result = *this; ++*this; return result; }mint operator--(int) { mint result = *this; --*this; return result; }mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }mint& operator*=(const mint& rhs) {v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint r = 1, x = *this;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const { assert(v); return pow(MOD - 2); }friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }};using mint = prime_modint<1000000007>;//using mint = prime_modint<998244353>;int main(){ios::sync_with_stdio(false);cin.tie(0);int T, a, b, c, d, e, l = 0, r = 0, D;cin >> T >> a >> b >> c >> d >> e;D = max({abs(a), abs(b), abs(c)});vector<mint> dp1(20001), dp2(20001);auto dp = dp1.begin() + 10000;auto ndp = dp2.begin() + 10000;dp[0] = 1;for(int i = 0; i < T; i++){for(int j = -i * D; j <= i * D; j++){ndp[j - a] += dp[j];ndp[j + a] += dp[j];ndp[j - b] += dp[j];ndp[j + b] += dp[j];ndp[j - c] += dp[j];ndp[j + c] += dp[j];dp[j] = 0;}swap(dp, ndp);}cout << accumulate(dp + d, dp + e + 1, mint(0)) << '\n';}