結果

問題 No.1683 Robot Guidance
ユーザー rniyarniya
提出日時 2021-09-17 22:25:27
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 9,562 bytes
コンパイル時間 2,163 ms
コンパイル使用メモリ 208,796 KB
実行使用メモリ 23,008 KB
最終ジャッジ日時 2024-06-29 21:04:18
合計ジャッジ時間 4,458 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 18 ms
14,928 KB
testcase_01 AC 19 ms
14,952 KB
testcase_02 AC 20 ms
14,928 KB
testcase_03 WA -
testcase_04 AC 20 ms
15,280 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 39 ms
22,740 KB
testcase_13 AC 25 ms
18,868 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 33 ms
20,440 KB
testcase_17 AC 20 ms
15,472 KB
testcase_18 AC 19 ms
15,108 KB
testcase_19 AC 19 ms
14,904 KB
testcase_20 AC 18 ms
15,004 KB
testcase_21 AC 19 ms
14,960 KB
testcase_22 AC 18 ms
14,912 KB
testcase_23 AC 27 ms
22,760 KB
testcase_24 WA -
testcase_25 AC 34 ms
22,752 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 27 ms
22,596 KB
testcase_29 AC 26 ms
22,760 KB
testcase_30 AC 27 ms
22,604 KB
testcase_31 AC 26 ms
21,732 KB
testcase_32 AC 27 ms
21,780 KB
testcase_33 AC 26 ms
20,928 KB
testcase_34 AC 30 ms
20,996 KB
testcase_35 AC 27 ms
21,864 KB
testcase_36 AC 32 ms
21,852 KB
testcase_37 AC 31 ms
20,260 KB
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

template <int i, typename T> void print_tuple(ostream&, const T&) {}
template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {
    if (i) os << ',';
    os << get<i>(t);
    print_tuple<i + 1, T, Args...>(os, t);
}
template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    os << '{';
    print_tuple<0, tuple<Args...>, Args...>(os, t);
    return os << '}';
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

/**
 * @brief modint
 * @docs docs/modulo/modint.md
 */
template <uint32_t mod> class modint {
    using i64 = int64_t;
    using u32 = uint32_t;
    using u64 = uint64_t;

public:
    u32 v;
    constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}
    constexpr u32& value() noexcept { return v; }
    constexpr const u32& value() const noexcept { return v; }
    constexpr modint operator+(const modint& rhs) const noexcept { return modint(*this) += rhs; }
    constexpr modint operator-(const modint& rhs) const noexcept { return modint(*this) -= rhs; }
    constexpr modint operator*(const modint& rhs) const noexcept { return modint(*this) *= rhs; }
    constexpr modint operator/(const modint& rhs) const noexcept { return modint(*this) /= rhs; }
    constexpr modint& operator+=(const modint& rhs) noexcept {
        v += rhs.v;
        if (v >= mod) v -= mod;
        return *this;
    }
    constexpr modint& operator-=(const modint& rhs) noexcept {
        if (v < rhs.v) v += mod;
        v -= rhs.v;
        return *this;
    }
    constexpr modint& operator*=(const modint& rhs) noexcept {
        v = (u64)v * rhs.v % mod;
        return *this;
    }
    constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.pow(mod - 2); }
    constexpr modint pow(u64 exp) const noexcept {
        modint self(*this), res(1);
        while (exp > 0) {
            if (exp & 1) res *= self;
            self *= self;
            exp >>= 1;
        }
        return res;
    }
    constexpr modint& operator++() noexcept {
        if (++v == mod) v = 0;
        return *this;
    }
    constexpr modint& operator--() noexcept {
        if (v == 0) v = mod;
        return --v, *this;
    }
    constexpr modint operator++(int) noexcept {
        modint t = *this;
        return ++*this, t;
    }
    constexpr modint operator--(int) noexcept {
        modint t = *this;
        return --*this, t;
    }
    constexpr modint operator-() const noexcept { return modint(mod - v); }
    template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }
    template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }
    template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }
    template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }
    constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }
    constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }
    constexpr bool operator!() const noexcept { return !v; }
    friend istream& operator>>(istream& s, modint& rhs) noexcept {
        i64 v;
        rhs = modint{(s >> v, v)};
        return s;
    }
    friend ostream& operator<<(ostream& s, const modint& rhs) noexcept { return s << rhs.v; }
};

/**
 * @brief combination
 * @docs docs/combinatorics/combination.md
 */
template <class M> struct Combination {
    vector<M> _fac, _inv, _finv;
    Combination(int n) : _fac(n + 1), _inv(n + 1), _finv(n + 1) {
        _fac[0] = _finv[n] = _inv[0] = 1;
        for (int i = 1; i <= n; i++) _fac[i] = _fac[i - 1] * i;
        _finv[n] /= _fac[n];
        for (int i = n - 1; i >= 0; i--) _finv[i] = _finv[i + 1] * (i + 1);
        for (int i = 1; i <= n; i++) _inv[i] = _finv[i] * _fac[i - 1];
    }
    M fac(int k) const { return _fac[k]; }
    M finv(int k) const { return _finv[k]; }
    M inv(int k) const { return _inv[k]; }
    M P(int n, int r) const {
        if (n < 0 || r < 0 || n < r) return 0;
        return _fac[n] * _finv[n - r];
    }
    M C(int n, int r) const {
        if (n < 0 || r < 0 || n < r) return 0;
        return _fac[n] * _finv[r] * _finv[n - r];
    }
};

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

using mint = modint<MOD>;
const int MAX_A = 1000010;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Combination<mint> COM(MAX_A);
    int A, B, X, Y;
    cin >> A >> B >> X >> Y;

    vector<int> cnt(4);
    for (int i = 0; i < 4; i++) cnt[i] = (B + 4 - i) / 4;
    vector<mint> dp1(A + 1, 0), dp2(A + 1, 0);
    for (int i = 0; i <= A; i++) {
        if (i < X || ((i - X) & 1)) continue;
        int r = X + (i - X) / 2, l = i - r;
        if (cnt[0] == 0 && r > 0) continue;
        if (cnt[2] == 0 && l > 0) continue;
        dp1[i] = (r > 0 ? COM.C(r + cnt[0] - 1, r) : 1) * (l > 0 ? COM.C(l + cnt[2] - 1, l) : 1);
    }
    for (int i = 0; i <= A; i++) {
        if (i < Y || ((i - Y) & 1)) continue;
        int r = Y + (i - Y) / 2, l = i - r;
        if (cnt[1] == 0 && r > 0) continue;
        if (cnt[3] == 0 && l > 0) continue;
        dp2[i] = (r > 0 ? COM.C(r + cnt[1] - 1, r) : 1) * (l > 0 ? COM.C(l + cnt[3] - 1, l) : 1);
    }

    mint ans = 0;
    for (int i = 0; i <= A; i++) ans += dp1[i] * dp2[A - i];
    cout << ans << '\n';
    return 0;
}
0