#928651 (C++17) No.936 Are

提出ソース

結果

問題	No.936 Are
ユーザー	heno239
提出日時	2023-11-13 21:53:06
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	161 ms / 3,000 ms
コード長	10,008 bytes
コンパイル時間	2,431 ms
コンパイル使用メモリ	157,840 KB
実行使用メモリ	11,844 KB
最終ジャッジ日時	2023-11-13 21:53:12
合計ジャッジ時間	5,597 ms
ジャッジサーバーID （参考情報）	judge12 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	7 ms 11,844 KB
testcase_01	AC	18 ms 11,844 KB
testcase_02	AC	159 ms 11,844 KB
testcase_03	AC	9 ms 11,844 KB
testcase_04	AC	8 ms 11,844 KB
testcase_05	AC	9 ms 11,844 KB
testcase_06	AC	8 ms 11,844 KB
testcase_07	AC	7 ms 11,844 KB
testcase_08	AC	7 ms 11,844 KB
testcase_09	AC	8 ms 11,844 KB
testcase_10	AC	8 ms 11,844 KB
testcase_11	AC	8 ms 11,844 KB
testcase_12	AC	8 ms 11,844 KB
testcase_13	AC	49 ms 11,844 KB
testcase_14	AC	130 ms 11,844 KB
testcase_15	AC	56 ms 11,844 KB
testcase_16	AC	97 ms 11,844 KB
testcase_17	AC	86 ms 11,844 KB
testcase_18	AC	40 ms 11,844 KB
testcase_19	AC	152 ms 11,844 KB
testcase_20	AC	153 ms 11,844 KB
testcase_21	AC	140 ms 11,844 KB
testcase_22	AC	86 ms 11,844 KB
testcase_23	AC	161 ms 11,844 KB
testcase_24	AC	160 ms 11,844 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
//constexpr ll mod = 998244353;
constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------


int trans(array<int, 4> &a) {
    int res = 0;
    per(i, 4)res = 5 * res + a[i];
    return res;
}
bool canwin[625];
vector<int> G[625];
void init() {
    rep(i, 625) {
        canwin[i] = false;
        array<int, 4> num;
        int cop = i;
        rep(i, 4) {
            num[i] = cop % 5; cop /= 5;
        }
        //attack
        rep(x, 2)if (num[x])rep(y, 2)if (num[y + 2]) {
            auto cop = num;
            cop[y + 2] += num[x]; cop[y + 2] %= 5;
            if (cop[2] + cop[3] == 0) {
                canwin[i] = true;
            }
        }
    }
    rep(i, 625) {
        //if (canwin[i])cout << i << "\n";
        array<int, 4> num;
        int cop = i;
        rep(i, 4) {
            num[i] = cop % 5; cop /= 5;
        }
        auto numcop = num;
        rep(t, 2)swap(numcop[t], numcop[t + 2]);
        if (canwin[trans(numcop)])continue;
        vector<int> rtos;
        //attack
        rep(x, 2)if (num[x])rep(y, 2)if (num[y + 2]) {
            auto cop = num;
            cop[x] += num[y + 2]; cop[x] %= 5;
            int to = trans(cop);
            if (!canwin[to]) {
                G[i].push_back(to);
            }
            else rtos.push_back(to);
        }
        //split
        int s = num[2] + num[3];
        while (s > 0) {
            rep(j, s + 1) {
                int le = j;
                int ri = s - j;
                if (le == num[2] && ri == num[3])continue;
                if (le == num[3] && ri == num[2])continue;
                if (le >= 5 || ri >= 5)continue;
                auto cop = num;
                cop[2] = le, cop[3] = ri;
                int to = trans(cop);
                if (!canwin[to]) {
                    assert(to < 625);
                    G[i].push_back(to);
                    //cout << "edge " << i << " " << to << "\n";
                }
                else rtos.push_back(to);
            }
            s -= 5;
        }
        if (G[i].empty())G[i] = rtos;
    }
}
void solve() {
    int n, k; cin >> n >> k;
    int l1, r1, l2, r2;
    cin >> l1 >> r1 >> l2 >> r2;
    int s = l1 + 5 * r1 + 25 * l2 + 125 * r2;
    vector<modint> dp(625, 0);
    dp[s] = 1;
    modint ans = 0;
    rep(i, k) {
        vector<modint> ndp(625);
        rep(j, dp.size()) {
            if (dp[j] == (modint)0)continue;
            //cout << i << " " << j << "\n";
            array<int, 4> num;
            int cop = j;
            rep(i, 4) {
                num[i] = cop % 5; cop /= 5;
            }
            if ((n+i) % 2==0) {
                //attack
                rep(x, 2)if(num[x])rep(y, 2)if(num[y+2]) {
                    auto cop = num;
                    cop[y + 2] += num[x]; cop[y + 2] %= 5;
                    if (cop[2] + cop[3] == 0) {
                        //cout << "??\n";
                        //cout << i << " " << j << " " << dp[j] << "\n";
                        ans += dp[j];
                    }
                    else {
                        ndp[trans(cop)] += dp[j];
                    }
                }
                //split
                int s = num[0] + num[1];
                while (s > 0) {
                    rep(i, s + 1) {
                        int le = i;
                        int ri = s - i;
                        if (le == num[0] && ri == num[1])continue;
                        if (le == num[1] && ri == num[0])continue;
                        if (le >= 5 || ri >= 5)continue;
                        auto cop = num;
                        cop[0] = le;
                        cop[1] = ri;
                        ndp[trans(cop)] += dp[j];
                    }
                    s -= 5;
                }
            }
            else {
                //attacksplit
                for (int to : G[j])ndp[to] += dp[j];
            }
        }
        swap(dp, ndp);
        //cout << i << "\n";
        //coutarray(dp);
    }
    cout << ans << "\n";
}



signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed<<setprecision(10);
    //init_f(); cout << comb(28, 7) << "\n";
    init();
    //init2();
    //while(true)
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード