結果

問題 No.834 Random Walk Trip
ユーザー jelljell
提出日時 2019-05-27 17:19:57
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 37 ms / 2,000 ms
コード長 13,094 bytes
コンパイル時間 6,994 ms
コンパイル使用メモリ 376,724 KB
実行使用メモリ 32,000 KB
最終ジャッジ日時 2024-09-17 15:32:21
合計ジャッジ時間 8,329 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 3 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 16 ms
24,192 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 23 ms
30,592 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 29 ms
26,752 KB
testcase_24 AC 2 ms
5,376 KB
testcase_25 AC 37 ms
32,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#include <cassert>
#include <iostream>
#include <algorithm>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <complex>
#include <iomanip>
#include <bitset>
#include <random>

using namespace std;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
using pdi = pair<double, int>;
template <class T> using vct = vector<T>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> constexpr T inf = numeric_limits<T>::max() / (T)1024;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double Pi = 3.1415926535897932384626433832795028841971;
constexpr long double Golden = 1.61803398874989484820;
constexpr long double eps = 1e-15;

#define iostream_untie true
#define mod 1000000007LL
#define stdout_precision 10
#define stderr_precision 6
#define itrep(i,v) for(auto i = begin(v); i != end(v); ++i)
#define ritrep(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount

namespace setup {
    struct setupper {
        setupper() {
            if(iostream_untie) {
                ios::sync_with_stdio(false);
                std::cin.tie(nullptr);
                std::cout.tie(nullptr);
                std::cerr.tie(nullptr);
            }
            std::cout << fixed << setprecision(stdout_precision);
            std::cerr << fixed << setprecision(stderr_precision);
    #ifdef LOCAL
            if(!freopen("input.txt","rt",stdin)) {
                cerr << "Failed to open the input file.\n"; exit(EXIT_FAILURE);
            }
            // if(!freopen("output.txt","wt",stdout)) {
            //     cerr << "Failed to open the output file.\n"; exit(EXIT_FAILURE);
            // }
            // std::cerr << "\n---stderr---\n";
            // auto print_atexit = []() {
            //     std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n";
            //     std::cerr << "------------\n";
            // };
            // atexit((void(*)())print_atexit);
            // atexit((void(*)())fclose(stdin));
    #endif
        }
    } __setupper;
}

namespace std {
    template <class RAitr> void rsort(RAitr __first, RAitr __last) {
        sort(__first, __last, greater<>());
    }
    template <class T> void hash_combine(size_t &seed, T const &key) {
        seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
    }
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &pr) const
        {
            size_t seed = 0;
            hash_combine(seed,pr.first);
            hash_combine(seed,pr.second);
            return seed;
        }
    };
    template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc {
        static void apply(size_t& seed, Tup const& tup) {
            hashval_calc<Tup, index - 1>::apply(seed, tup);
            hash_combine(seed,get<index>(tup));
        }
    };
    template <class Tup> struct hashval_calc<Tup,0> {
        static void apply(size_t& seed, Tup const& tup) {
            hash_combine(seed,get<0>(tup));
        }
    };
    template <class ...T> struct hash<tuple<T...>> {
        size_t operator()(tuple<T...> const& tup) const
        {
            size_t seed = 0;
            hashval_calc<tuple<T...>>::apply(seed,tup);
            return seed;
        }
    };
}

template <class T, class U> istream &operator>> (istream &s, pair<T,U> &p) { return s >> p.first >> p.second; }
template <class T, class U> ostream &operator<< (ostream &s, const pair<T,U> p) { return s << p.first << " " << p.second; }
template <class T> ostream &operator<< (ostream &s, const vector<T> &v) {
    for(size_t i = 0; i < v.size(); ++i) s << (i ? " " : "") << v[i]; return s;
}
#define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ";\
dump_func(__VA_ARGS__)
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
template <class T = i64> T read() { T x; return cin >> x, x; }
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)

namespace updater {
    template <class T> static void add(T &x, const T &y) { x += y; }
    template <class T> static void ext_add(T &x, const T &y, size_t w) { x += y * w; }
    template <class T> static void mul(T &x, const T &y) { x *= y; }
    template <class T> static void ext_mul(T &x, const T &y, size_t w) { x *= (T)pow(y,w); }
    template <class T> static bool chmax(T &x, const T &y) { return x < y ? x = y,true : false; }
    template <class T> static bool chmin(T &x, const T &y) { return x > y ? x = y,true : false; }
};
using updater::add;
using updater::chmax;
using updater::chmin;

template <class T> constexpr T minf(const T &x, const T &y) { return min(x,y); }
template <class T> constexpr T maxf(const T &x, const T &y) { return max(x,y); }
constexpr bool bit(i64 n, uint8_t e) { return (n >> e) & 1; }
constexpr i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
constexpr int ilog(uint64_t x, uint64_t b = 2) { return x ? 1 + ilog(x / b,b) : -1; }
template <class F> int64_t binry(int64_t ok, int64_t ng, const F &fn) {
    while (abs(ok - ng) > 1) {
        int64_t mid = (ok + ng) / 2;
        (fn(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array,(T*)(array + N),val); }
template <class T> vector<T> cmprs(const vector<T> &v) {
    vector<T> tmp = v; sort(begin(tmp),end(tmp));
    tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
    vector<T> ret = v; 
    itrep(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp);
    return ret;
}
template <class T> vector<T> cmprs(const T ary[], size_t n) {
    return cmprs(vector<T>(ary,ary + n));
}
template <class F> void for_subset(uint_fast64_t s, const F &fn) {
    uint_fast64_t tmp = s;
    do { fn(tmp); } while((--tmp &= s) != s);
}


/* The main code follows. */


/* The snippet starts here. */
namespace Calcfn {
    #ifndef mod
        #define mod 1000000007LL
    #endif
    struct modint {
        int x;
        constexpr modint() : x(0) {}
        constexpr modint(int_fast64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

        constexpr modint &operator+=(const modint &p) {
            if((x += p.x) >= mod) x -= mod;
            return *this;
        }

        constexpr modint &operator ++() { return ++x,*this; }

        constexpr modint operator ++(int) {
            modint t = *this; 
            return ++x,t;
        }

        constexpr modint &operator-=(const modint &p) {
            if((x += mod - p.x) >= mod) x -= mod;
            return *this;
        }

        constexpr modint &operator --() { return --x,*this; }

        constexpr modint operator --(int) {
            modint t = *this;
            return --x,t;
        }

        constexpr modint &operator*=(const modint &p) {
            x = (int) (1LL * x * p.x % mod);
            return *this;
        }

        constexpr modint &operator/=(const modint &p) {
            *this *= inverse(p);
            return *this;
        }

        constexpr modint operator-() { return modint(-x); }

        constexpr modint operator+(const modint &p) { return modint(*this) += p; }

        constexpr modint operator-(const modint &p) { return modint(*this) -= p; }

        constexpr modint operator*(const modint &p) { return modint(*this) *= p; }

        constexpr modint operator/(const modint &p) { return modint(*this) /= p; }

        constexpr bool operator==(const modint &p) { return x == p.x; }

        constexpr bool operator!=(const modint &p) { return x != p.x; }

        constexpr bool operator!() { return !x; }

        constexpr bool operator>(const modint &p) { return x > p.x; }

        constexpr bool operator<(const modint &p) { return x <  p.x; }

        constexpr bool operator>=(const modint &p) { return x >= p.x; }

        constexpr bool operator<=(const modint &p) { return x <= p.x; }

        constexpr static modint inverse(const modint &p) {
            int a = p.x, b = mod, u = 1, v = 0;
            while(b > 0) {
                int t = a / b;
                a -= t * b;
                a ^= b ^= a ^= b;
                u -= t * v;
                u ^= v ^= u ^= v;
            }
            return modint(u);
        }

        constexpr static modint pow(modint p, uint_fast64_t e) {
            if(!e) return 1;
            return pow(p * p, e >> 1) * (e & 1 ? p : 1);
        }

        friend ostream &operator<<(ostream &s, const modint &p) { return s << p.x; }

        friend istream &operator>>(istream &s, modint &p) {
            uint_fast64_t x;
            p = modint((s >> x,x));
            return s;
        }
    };

    constexpr static int N = 2e5 + 2e4, N_max = 2e6 + 2e5;

    struct impl {
        int_fast64_t fact_[N + 1],invfact_[N + 1],inv_[N + 1];

        constexpr impl() : fact_(),invfact_(),inv_() {
            fact_[0] = 1;
            for(int i = 1; i <= N; ++i) fact_[i] = fact_[i - 1] * i % mod;
            inv_[1] = 1;
            for(int i = 2; i <= N; ++i) inv_[i] = mod - inv_[mod % i] * (mod / i) % mod;
            invfact_[0] = 1;
            for(int i = 1; i <= N; ++i) invfact_[i] = invfact_[i - 1] * inv_[i] % mod;
        }
    };
    constexpr static impl impl_exe;

    int_fast64_t _dyn_fact[N_max + 1];
    int_fast64_t _dyn_inv[N_max + 1];
    int_fast64_t _dyn_invfact[N_max + 1];

    static int_fast64_t dyn_fact(int x) {
        assert(x <= N_max);
        if(x < 0) return 0;
        static size_t _size = 1;
        for(size_t &i = _size; i <= x; ++i) {
            if(i <= N) _dyn_fact[i] = impl_exe.fact_[i];
            else _dyn_fact[i] = _dyn_fact[i - 1] * i % mod;
        }   
        return _dyn_fact[x];
    }

    static int_fast64_t dyn_invfact(int x) {
        assert(x <= N_max);
        if(x < 0)  return 0;
        static size_t _size = 1;
        for(size_t &i = _size; i <= x; ++i) {
            if(i <= N) {
                _dyn_inv[i] = impl_exe.inv_[i];
                _dyn_invfact[i] = impl_exe.invfact_[i];
            } else {
                _dyn_inv[i] = mod - _dyn_inv[mod % i] * (mod / i) % mod;
                _dyn_invfact[i] = _dyn_invfact[i - 1] * _dyn_inv[i] % mod;
            }
        }
        return _dyn_invfact[x];
    }

    static modint fact(int x) {
        if(x > N) return dyn_fact(x);
        return x >= 0 ? impl_exe.fact_[x] : 0;
    }

    static modint invfact(int x) {
        if(x > N) return dyn_invfact(x);
        return x >= 0 ? impl_exe.invfact_[x] : 0;
    }

    static modint comb(int x, int y) {
        return fact(x) * invfact(y) * invfact(x - y);
    }

    static modint perm(int x, int y) {
        return comb(x,y) * fact(y);
    }

    constexpr static int_fast64_t gcd(int_fast64_t a, int_fast64_t b) {
        if(!b) return a > 0 ? a : -a; return gcd(b, a % b);
    }

    constexpr static int_fast64_t lcm(int_fast64_t a, int_fast64_t b) {
        if(a | b) return a / gcd(a, b) * b; return 0;
    }

    constexpr static int_fast64_t ext_gcd(int_fast64_t a, int_fast64_t b, int_fast64_t &x, int_fast64_t &y) {
        int_fast64_t d = a;
        if (b) d = ext_gcd(b, a % b, y, x), y -= (a / b) * x;
        else x = 1, y = 0;
        return d;
    }
}
using Calcfn::modint;
using Calcfn::fact;
using Calcfn::perm;
using Calcfn::comb;
/* The snippet ends here. */



int n,m;
modint ans;

signed main() {
    cin>>n>>m;
    if(n==1) esc(1);
    if(m&1) {
        for(int x=-1; x<=m; x+=n*2) {
            ans+=comb(m,(m-x)/2);
        }
        for(int x=-1-n*2; x>=-m; x-=n*2) {
            ans+=comb(m,(m-x)/2);
        }
    } else {
        for(int x=0; x<=m; x+=n*2) {
            ans+=comb(m,(m-x)/2);
        }
        for(int x=-n*2; x>=-m; x-=n*2) {
            ans+=comb(m,(m-x)/2);
        }
    }
    esc(ans);
}
0