#404836 (C++14) No.940 ワープ　ε=ε=ε=ε=ε=│;p>д＜│

提出ソース

結果

問題	No.940 ワープ　ε=ε=ε=ε=ε=│;p>д＜│
ユーザー	jell
提出日時	2019-12-04 23:51:58
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	534 ms / 5,000 ms
コード長	6,439 bytes
コンパイル時間	1,755 ms
コンパイル使用メモリ	172,188 KB
実行使用メモリ	52,480 KB
最終ジャッジ日時	2024-05-08 12:09:28
合計ジャッジ時間	12,956 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	328 ms 52,352 KB
testcase_01	AC	319 ms 52,352 KB
testcase_02	AC	322 ms 52,352 KB
testcase_03	AC	331 ms 52,352 KB
testcase_04	AC	331 ms 52,352 KB
testcase_05	AC	334 ms 52,352 KB
testcase_06	AC	328 ms 52,352 KB
testcase_07	AC	328 ms 52,352 KB
testcase_08	AC	337 ms 52,352 KB
testcase_09	AC	332 ms 52,352 KB
testcase_10	AC	334 ms 52,352 KB
testcase_11	AC	345 ms 52,352 KB
testcase_12	AC	335 ms 52,352 KB
testcase_13	AC	337 ms 52,352 KB
testcase_14	AC	343 ms 52,480 KB
testcase_15	AC	329 ms 52,352 KB
testcase_16	AC	399 ms 52,352 KB
testcase_17	AC	424 ms 52,352 KB
testcase_18	AC	450 ms 52,352 KB
testcase_19	AC	415 ms 52,352 KB
testcase_20	AC	482 ms 52,480 KB
testcase_21	AC	386 ms 52,352 KB
testcase_22	AC	483 ms 52,480 KB
testcase_23	AC	390 ms 52,352 KB
testcase_24	AC	484 ms 52,352 KB
testcase_25	AC	522 ms 52,352 KB
testcase_26	AC	534 ms 52,352 KB

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

コンパイルメッセージ

main.cpp:111:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  111 | main()
      | ^~~~

ソースコード

raw source code

#include <bits/stdc++.h>

#ifndef MODULO_HPP
#define MODULO_HPP
#include <iostream>
namespace modulo
{
    template <int mod>
    class modint
    {
        int val;
      public:
        constexpr modint() : val{0} {}
        constexpr modint(long long x) : val((x %= mod) < 0 ? mod + x : x) {}
        constexpr long long get() const { return val; }
        constexpr modint &operator+=(const modint &other) { return (val += other.val) < mod ? 0 : val -= mod, *this; }
        constexpr modint &operator++() { return ++val, *this; }
        constexpr modint operator++(int) { modint t = *this; return ++val, t; }
        constexpr modint &operator-=(const modint &other) { return (val += mod - other.val) < mod ? 0 : val -= mod, *this; }
        constexpr modint &operator--() { return --val, *this; }
        constexpr modint operator--(int) { modint t = *this; return --val, t; }
        constexpr modint &operator*=(const modint &other) { return val = (long long)val * other.val % mod, *this; }
        constexpr modint &operator/=(const modint &other) { return *this *= inverse(other); }
        constexpr modint operator-() const { return modint(-val); }
        constexpr modint operator+(const modint &other) const { return modint(*this) += other; }
        constexpr modint operator-(const modint &other) const { return modint(*this) -= other; }
        constexpr modint operator*(const modint &other) const { return modint(*this) *= other; }
        constexpr modint operator/(const modint &other) const { return modint(*this) /= other; }
        constexpr bool operator==(const modint &other) const { return val == other.val; }
        constexpr bool operator!=(const modint &other) const { return val != other.val; }
        constexpr bool operator!() const { return !val; }
        friend constexpr modint inverse(const modint &other)
        {
            assert(other != 0);
            int a{mod}, b{other.val}, u{}, v{1}, t{};
            while(b) t = a / b, a ^= b ^= (a -= t * b) ^= b, u ^= v ^= (u -= t * v) ^= v;
            return modint{u};
        }
        friend constexpr modint pow(modint other, long long e)
        {
            if(e < 0) e = e % (mod - 1) + mod - 1;
            modint res{1};
            while(e) { if(e & 1) res *= other; other *= other, e >>= 1; }
            return res;
        }
        friend std::ostream &operator<<(std::ostream &s, const modint &other) { return s << other.val; }
        friend std::istream &operator>>(std::istream &s, modint &other) { long long val; other = modint{(s >> val, val)}; return s; }
    }; // class modint
    template <>
    class modint<2>
    {
        bool val;
      public:
        constexpr modint(bool x = false) : val{x} {}
        constexpr modint(int x) : val(x & 1) {}
        constexpr modint(long long x) : val(x & 1) {}
        constexpr bool get() const { return val; }
        constexpr modint &operator+=(const modint &other) { return val ^= other.val, *this; }
        constexpr modint &operator++() { return val = !val, *this; }
        constexpr modint operator++(int) { modint t = *this; return val = !val, t; }
        constexpr modint &operator-=(const modint &other) { return val ^= other.val, *this; }
        constexpr modint &operator--() { return val = !val, *this; }
        constexpr modint operator--(int) { modint t = *this; return val = !val, t; }
        constexpr modint &operator*=(const modint &other) { return val &= other.val, *this; }
        constexpr modint &operator/=(const modint &other) { return *this; }
        constexpr modint operator-() const { return *this; }
        constexpr modint operator+(const modint &other) const { return val != other.val; }
        constexpr modint operator-(const modint &other) const { return val != other.val; }
        constexpr modint operator*(const modint &other) const { return val && other.val; }
        constexpr modint operator/(const modint &other) const { return *this; }
        constexpr bool operator==(const modint &other) const { return val == other.val; }
        constexpr bool operator!=(const modint &other) const { return val != other.val; }
        constexpr bool operator!() const { return !val; }
        operator bool() const { return val; }
        friend constexpr modint inverse(const modint &other) { return other; }
        friend constexpr modint pow(const modint &other, long long exp) { return other; }
        friend std::ostream &operator<<(std::ostream &os, const modint &other) { return os << other.val; }
        friend std::istream &operator>>(std::istream &is, modint &other) { long long val; other.val = (is >> val, val & 1); return is; }
    }; // class modint specialization
} // namespace modulo
#endif

class binom_runtime
{
    const int mod;
    int n;
    std::vector<int> _fact, _inv, _invfact;
  public:
    binom_runtime(int _mod) : mod(_mod), n{2}, _fact{1, 1}, _inv{0, 1}, _invfact{1, 1} {}
    void build(int m)
    {
        int _n = n;
        while(m >= n) n <<= 1;
        _fact.resize(n), _inv.resize(n), _invfact.resize(n);
        for(int i = _n; i < n; ++i)
        {
            _fact[i] = (long long)_fact[i - 1] * i % mod;
            _inv[i] = mod - (long long)mod / i * _inv[mod % i] % mod;
            _invfact[i] = (long long)_invfact[i - 1] * _inv[i] % mod;
        }
    }
    long long fact(int x) { return build(x), x < 0 ? 0 : _fact[x]; }
    long long inv(int x) { return build(x), x < 0 ? 0 : _inv[x]; }
    long long invfact(int x) { return build(x), x < 0 ? 0 : _invfact[x]; }
    long long binom(int x, int y) { return fact(x) * invfact(y) % mod * invfact(x - y) % mod; }
};

using modint = modulo::modint<1000000007>;
using namespace std;

main()
{
    binom_runtime gen(1000000007);
    gen.build(2200010);
    int X,Y,Z;

    while(cin>>X>>Y>>Z)
    {
        modint ans,s{1};
        for(int k=X+Y+Z,f=1; k>=0; --k,f^=1)
        {
            modint tmp=s;
            if(X)
            {
                tmp*=gen.binom(X+k-1,k-1);
            }
            if(Y)
            {
                tmp*=gen.binom(Y+k-1,k-1);
            }
            if(Z)
            {
                tmp*=gen.binom(Z+k-1,k-1);
            }
            ans+=tmp;
            s*=2;
            if(f)
            {
                s-=gen.binom(X+Y+Z+1,k);
            }
            else
            {
                s+=gen.binom(X+Y+Z+1,k);
            }
        }
        cout << ans << "\n";
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード