結果

問題 No.1683 Robot Guidance
ユーザー Enjapma_kyoproEnjapma_kyopro
提出日時 2021-09-18 16:24:27
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 133 ms / 2,000 ms
コード長 4,735 bytes
コンパイル時間 1,636 ms
コンパイル使用メモリ 173,120 KB
実行使用メモリ 128,388 KB
最終ジャッジ日時 2024-06-30 13:55:34
合計ジャッジ時間 7,914 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 119 ms
128,184 KB
testcase_01 AC 120 ms
128,184 KB
testcase_02 AC 119 ms
128,184 KB
testcase_03 AC 122 ms
128,168 KB
testcase_04 AC 120 ms
128,284 KB
testcase_05 AC 120 ms
128,228 KB
testcase_06 AC 123 ms
128,180 KB
testcase_07 AC 121 ms
128,320 KB
testcase_08 AC 130 ms
128,172 KB
testcase_09 AC 121 ms
128,244 KB
testcase_10 AC 127 ms
128,168 KB
testcase_11 AC 125 ms
128,340 KB
testcase_12 AC 131 ms
128,196 KB
testcase_13 AC 119 ms
128,204 KB
testcase_14 AC 127 ms
128,208 KB
testcase_15 AC 120 ms
128,212 KB
testcase_16 AC 119 ms
128,224 KB
testcase_17 AC 120 ms
128,240 KB
testcase_18 AC 119 ms
128,180 KB
testcase_19 AC 119 ms
128,176 KB
testcase_20 AC 120 ms
128,244 KB
testcase_21 AC 119 ms
128,296 KB
testcase_22 AC 119 ms
128,264 KB
testcase_23 AC 120 ms
128,320 KB
testcase_24 AC 133 ms
128,200 KB
testcase_25 AC 121 ms
128,208 KB
testcase_26 AC 119 ms
128,176 KB
testcase_27 AC 119 ms
128,388 KB
testcase_28 AC 120 ms
128,276 KB
testcase_29 AC 119 ms
128,160 KB
testcase_30 AC 119 ms
128,264 KB
testcase_31 AC 120 ms
128,216 KB
testcase_32 AC 121 ms
128,164 KB
testcase_33 AC 121 ms
128,224 KB
testcase_34 AC 124 ms
128,232 KB
testcase_35 AC 122 ms
128,184 KB
testcase_36 AC 122 ms
128,228 KB
testcase_37 AC 120 ms
128,264 KB
testcase_38 AC 120 ms
128,316 KB
testcase_39 AC 120 ms
128,248 KB
testcase_40 AC 119 ms
128,200 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

// using mint = long double;
// using mint = atcoder::modint998244353;
// using mint = atcoder::modint1000000007;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
typedef pair<ll, vector<ll>> Pd;

const ll INF = 3e18;
const ll fact_table = 8000050;

/*
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
// priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop
*/

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};

//↓,→,↑,←

#define p(x) cout << x << "\n";
#define el cout << "\n";
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = a; i <= (b); i++)
#define rep3(i, a, b) for (ll i = a; i >= (b); i--)
#define all(c) begin(c), end(c)
#define sorti(v) sort(all(v))
#define sortd(v)                                                               \
    sort(all(v));                                                              \
    reverse(all(v));
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

// vec v(n) -> 長さnのベクトルを宣言
// mat dp(h, vec(w)) -> h * w の行列を宣言

const ll mod = 1000000007ll;
// const ll mod = 998244353ll;

ll mypow(ll a, ll b, ll m = mod) {
    ll x = 1;
    while (b) {
        while (!(b & 1)) {
            (a *= a) %= m;
            b >>= 1;
        }
        (x *= a) %= m;
        b--;
    }
    return x;
}
vec rv(ll read) {
    vec res(read);
    for (int i = 0; i < read; i++) {
        cin >> res[i];
    }
    return res;
}

vec fact, rfact;

void c3_init() {
    fact.resize(fact_table + 5);
    rfact.resize(fact_table + 5);
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}

ll c3(ll n, ll r) {
    if (n < r) return 0ll;
    return fact[n] * rfact[r] % mod * rfact[n - r] % mod;
}

bool icpc = false;
bool multicase = false;

// 配列の長さ足りてますか？
ll n, m, sum;
ll a, b, x, y;

bool solve() {
    c3_init();
    cin >> a >> b >> x >> y;
    bool dame = false;
    if (a < abs(x) + abs(y)) {
        dame = true;
    } else if ((a - abs(x) - abs(y)) % 2 == 1) {
        dame = true;
    }
    if (dame) {
        p(0);
        return true;
    }

    ll ap = 0, an = 0, bp = 0, bn = 0;

    if (x > 0) {
        ap = x;
    } else {
        an = -x;
    }
    if (y > 0) {
        bp = y;
    } else {
        bn = -y;
    }
    ll ans = 0ll;
    for (ll k = 0;; k++) {
        ll app = ap, bpp = bp, ann = an, bnn = bn;
        ll res = (a - ap - bp - an - bn) / 2ll;
        assert((a - ap - bp - an - bn) % 2ll == 0);

        app += k;
        ann += k;
        bpp += res - k;
        bnn += res - k;

        if (app < 0 || ann < 0 || bpp < 0 || bnn < 0) continue;
        if (res - k < 0) break;

        ll ret = 1ll;
        ll apc = (b + 4ll) / 4ll;
        ll bpc = (b + 3ll) / 4ll;
        ll anc = (b + 2ll) / 4ll;
        ll bnc = (b + 1ll) / 4ll;

        ret *= c3(apc - 1ll + app, apc - 1ll);

        if (bpc == 0 && bpp > 0) {
            ret = 0;
        } else if (bpc == 0 && bpp == 0) {

        } else {
            ret *= c3(bpc - 1ll + bpp, bpc - 1ll);
        }
        ret %= mod;
        if (anc == 0 && ann > 0) {
            ret = 0;
        } else if (anc == 0 && ann == 0) {

        } else {
            ret *= c3(anc - 1ll + ann, anc - 1ll);
        }
        ret %= mod;

        if (bnc == 0 && bnn > 0) {
            ret = 0;
        } else if (bnc == 0 && bnn == 0) {

        } else {
            ret *= c3(bnc - 1ll + bnn, bnc - 1ll);
        }
        ret %= mod;
        ans += ret;
        ans %= mod;

        if (res - k == 0) break;
    }
    p(ans);
    return true;
}

/*







*/

int main() {

    // ios::sync_with_stdio(false);
    // cin.tie(nullptr);

    if (icpc) {
        while (solve())
            ;
        return 0;
    }
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // cout << "Case #" << testcase << ": ";
        solve();
        testcase++;
    }

    // solve();
    return 0;
}
0