結果
問題 | No.612 Move on grid |
ユーザー | はまやんはまやん |
提出日時 | 2018-01-01 11:59:04 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,038 ms / 2,500 ms |
コード長 | 3,261 bytes |
コンパイル時間 | 1,613 ms |
コンパイル使用メモリ | 177,188 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-02 03:59:04 |
合計ジャッジ時間 | 10,255 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 31 ms
6,944 KB |
testcase_04 | AC | 38 ms
6,944 KB |
testcase_05 | AC | 1,038 ms
6,940 KB |
testcase_06 | AC | 1,017 ms
6,944 KB |
testcase_07 | AC | 18 ms
6,940 KB |
testcase_08 | AC | 995 ms
6,944 KB |
testcase_09 | AC | 443 ms
6,940 KB |
testcase_10 | AC | 335 ms
6,940 KB |
testcase_11 | AC | 78 ms
6,940 KB |
testcase_12 | AC | 561 ms
6,940 KB |
testcase_13 | AC | 174 ms
6,944 KB |
testcase_14 | AC | 787 ms
6,940 KB |
testcase_15 | AC | 89 ms
6,944 KB |
testcase_16 | AC | 927 ms
6,944 KB |
testcase_17 | AC | 81 ms
6,940 KB |
testcase_18 | AC | 745 ms
6,944 KB |
testcase_19 | AC | 184 ms
6,944 KB |
testcase_20 | AC | 269 ms
6,940 KB |
ソースコード
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<b;i++) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } //--------------------------------------------------------------------------------------------------- template<int MOD> struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) { } ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } return ModInt(u); } bool operator==(ModInt that) const { return x == that.x; } bool operator!=(ModInt that) const { return x != that.x; } ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; } }; template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; }; template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) { ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; } typedef ModInt<1000000007> mint; /*--------------------------------------------------------------------------------------------------- ∧_∧ ∧_∧ (´<_` ) Welcome to My Coding Space! ( ´_ゝ`) / ⌒i / \ | | / / ̄ ̄ ̄ ̄/ | __(__ニつ/ _/ .| .|____ \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ int T, a, b, c, d, e; //--------------------------------------------------------------------------------------------------- void _main() { cin >> T >> a >> b >> c >> d >> e; map<int, mint> dp; dp[0] = 1; rep(t, 0, T) { map<int, mint> pd; fore(p, dp) { pd[p.first + a] += p.second; pd[p.first + b] += p.second; pd[p.first + c] += p.second; pd[p.first - a] += p.second; pd[p.first - b] += p.second; pd[p.first - c] += p.second; } swap(dp, pd); } mint ans = 0; fore(p, dp) if (d <= p.first and p.first <= e) ans += p.second; cout << ans << endl; }