#403147 (C++14) No.936 Are

• 問題: No.936 Are
• ユーザー: hitonanode
• 提出日時: 2019-11-30 11:02:48
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,697 ms / 3,000 ms
• コード長: 5,955 bytes
• コンパイル時間: 2,371 ms
• コンパイル使用メモリ: 197,260 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-21 01:07:33
• 合計ジャッジ時間: 20,134 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 6,816 KB
testcase_01	AC	1,685 ms; 6,820 KB
testcase_02	AC	1,696 ms; 6,820 KB
testcase_03	AC	7 ms; 6,816 KB
testcase_04	AC	10 ms; 6,816 KB
testcase_05	AC	6 ms; 6,816 KB
testcase_06	AC	8 ms; 6,816 KB
testcase_07	AC	5 ms; 6,816 KB
testcase_08	AC	4 ms; 6,820 KB
testcase_09	AC	7 ms; 6,816 KB
testcase_10	AC	6 ms; 6,820 KB
testcase_11	AC	7 ms; 6,816 KB
testcase_12	AC	3 ms; 6,816 KB
testcase_13	AC	461 ms; 6,816 KB
testcase_14	AC	1,367 ms; 6,816 KB
testcase_15	AC	538 ms; 6,820 KB
testcase_16	AC	976 ms; 6,820 KB
testcase_17	AC	870 ms; 6,816 KB
testcase_18	AC	356 ms; 6,816 KB
testcase_19	AC	1,604 ms; 6,816 KB
testcase_20	AC	1,606 ms; 6,816 KB
testcase_21	AC	1,464 ms; 6,820 KB
testcase_22	AC	871 ms; 6,816 KB
testcase_23	AC	1,697 ms; 6,816 KB
testcase_24	AC	1,693 ms; 6,816 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#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> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;


constexpr lint MOD = 1000000007;
template <int mod>
struct ModInt
{
    using lint = long long;
    int val;
    constexpr ModInt() : val(0) {}
    constexpr void _setval(lint v) { v = (v % mod) + mod; val = v >= mod ? v - mod : v; }
    constexpr ModInt(lint v) { _setval(v); }
    constexpr ModInt operator+(const ModInt &x) const { return ModInt((lint)val + x.val); }
    constexpr ModInt operator-(const ModInt &x) const { return ModInt((lint)val - x.val); }
    constexpr ModInt operator*(const ModInt &x) const { return ModInt((lint)val * x.val); }
    constexpr ModInt operator/(const ModInt &x) const { return ModInt((lint)val * x.inv()); }
    constexpr ModInt operator-() const { return ModInt(-val); }
    constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; }
    constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; }
    constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; }
    constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; }
    friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt(a % mod + x.val); }
    friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt(a % mod - x.val); }
    friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt(a % mod * x.val); }
    friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt(a % mod * x.inv()); }
    constexpr bool operator==(const ModInt &x) { return val == x.val; }
    constexpr bool operator!=(const ModInt &x) { return val != x.val; }
    friend istream &operator>>(istream &is, ModInt &x) { lint t; is >> t; x = ModInt(t); return is; }
    friend ostream &operator<<(ostream &os, const ModInt &x) { os << x.val;  return os; }
};
using mint = ModInt<MOD>;

bool ch(int i, int j, int k, int l)
{
    if (k + l == 0) return false;
    if (k * l == 0 and (i + k + l == 5 or j + k + l == 5)) return false;
    return true;
}

bool bunkatsu(int i, int j, int s, int t)
{
    // (i, j) -> (s, t) が許されるかどうか
    if (s + t and i + j and (s + t == i + j or s + t == i + j - 5) and !(i == s and j == t) and !(i == t and j == s)) return true;
    else return false;
}

int main()
{
    int N, K;
    cin >> N >> K;
    int L1, R1, L2, R2;
    cin >> L1 >> R1 >> L2 >> R2;
    vector<vector<vector<vector<mint>>>> dp;
    ndarray(dp, 5, 5, 5, 5);
    dp[L1][R1][L2][R2] = 1;
    mint ret = 0;
    while (K--)
    {
        vector<vector<vector<vector<mint>>>> dpnxt;
        ndarray(dpnxt, 5, 5, 5, 5);
        if (N == 0)
        {
            // Iotのターン
            REP(i, 5) REP(j, 5) REP(k, 5) REP(l, 5) if ((i + j) and (k + l))
            {
                REP(s, 5) REP(t, 5) if (bunkatsu(i, j, s, t))
                {
                    dpnxt[s][t][k][l] += dp[i][j][k][l];
                }
                if (k and i) dpnxt[i][j][(k + i) % 5][l] += dp[i][j][k][l];
                if (k and j) dpnxt[i][j][(k + j) % 5][l] += dp[i][j][k][l];
                if (l and i) dpnxt[i][j][k][(l + i) % 5] += dp[i][j][k][l];
                if (l and j) dpnxt[i][j][k][(l + j) % 5] += dp[i][j][k][l];
            }
            REP(i, 5) REP(j, 5)
            {
                ret += dpnxt[i][j][0][0];
                dpnxt[i][j][0][0] = 0;
            }
        }
        else
        {
            // Takahashiのターン
            REP(i, 5) REP(j, 5) REP(k, 5) REP(l, 5) if ((i + j) and (k + l))
            {
                if (i * j == 0 and (i + j + k == 5 or i + j + l == 5)) // Takahashiの勝ち
                {
                    continue;
                }
                if (k + l == 1) // Takahashiの負けが確定している場合のみ例外処理
                {
                    if (i == 3 and j == 3)
                    {
                        dpnxt[3][4][k][l] += dp[i][j][k][l] * 2;
                        continue;
                    }
                    if (i == 4 and j == 4)
                    {
                        dpnxt[0][4][k][l] += dp[i][j][k][l] * 2;
                        continue;
                    }
                    if (i * j == 0 and i + j == 3)
                    {
                        dpnxt[0][4][k][l] += dp[i][j][k][l];
                        continue;
                    }
                }
                REP(s, 5) REP(t, 5) if (bunkatsu(k, l, s, t))
                {
                    if (ch(i, j, s, t)) dpnxt[i][j][s][t] += dp[i][j][k][l];
                }
                if (i and k and ch((i + k) % 5, j, k, l)) dpnxt[(i + k) % 5][j][k][l] += dp[i][j][k][l];
                if (i and l and ch((i + l) % 5, j, k, l)) dpnxt[(i + l) % 5][j][k][l] += dp[i][j][k][l];
                if (j and k and ch(i, (j + k) % 5, k, l)) dpnxt[i][(j + k) % 5][k][l] += dp[i][j][k][l];
                if (j and l and ch(i, (j + l) % 5, k, l)) dpnxt[i][(j + l) % 5][k][l] += dp[i][j][k][l];
            }
            REP(k, 5) REP(l, 5) dpnxt[0][0][k][l] = 0;
        }
        dp = dpnxt;
        N = !N;
    }
    cout << ret << endl;
}