#434244 (C++14) No.895 MESE

• 問題: No.895 MESE
• ユーザー: bin101
• 提出日時: 2020-02-25 02:49:55
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: CE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 6,686 bytes
• コンパイル時間: 1,330 ms
• コンパイル使用メモリ: 97,932 KB
• 最終ジャッジ日時: 2024-04-21 01:09:03
• 合計ジャッジ時間: 1,799 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

コンパイルメッセージ

main.cpp:71:15: error: 'uint_fast64_t' does not name a type
   71 |     using u64=uint_fast64_t;
      |               ^~~~~~~~~~~~~
main.cpp:72:5: error: 'u64' does not name a type
   72 |     u64 a;
      |     ^~~
main.cpp: In constructor 'constexpr ModInt::ModInt()':
main.cpp:73:25: error: class 'ModInt' does not have any field named 'a'
   73 |     constexpr ModInt() :a(0){}
      |                         ^
main.cpp: In constructor 'constexpr ModInt::ModInt(ll)':
main.cpp:74:29: error: class 'ModInt' does not have any field named 'a'
   74 |     constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}
      |                             ^
main.cpp: In member function 'constexpr ModInt& ModInt::operator+=(ModInt)':
main.cpp:102:9: error: 'a' was not declared in this scope
  102 |         a+=rhs.a;
      |         ^
main.cpp:102:16: error: 'const struct ModInt' has no member named 'a'
  102 |         a+=rhs.a;
      |                ^
main.cpp: In member function 'constexpr ModInt& ModInt::operator-=(ModInt)':
main.cpp:107:16: error: 'const struct ModInt' has no member named 'a'
  107 |         if(rhs.a>a) a+=MOD;
      |                ^
main.cpp:107:18: error: 'a' was not declared in this scope
  107 |         if(rhs.a>a) a+=MOD;
      |                  ^
main.cpp:108:9: error: 'a' was not declared in this scope
  108 |         a-=rhs.a;
      |         ^
main.cpp:108:16: error: 'const struct ModInt' has no member named 'a'
  108 |         a-=rhs.a;
      |                ^
main.cpp: In member function 'constexpr ModInt& ModInt::operator*=(ModInt)':
main.cpp:112:9: error: 'a' was not declared in this scope
  112 |         a=(a*rhs.a)%MOD;
      |         ^
main.cpp:112:18: error: 'const struct ModInt' has no member named 'a'
  112 |         a=(a*rhs.a)%MOD;
      |                  ^
main.cpp: In member function 'constexpr ModInt& ModInt::operator/=(ModInt)':
main.cpp:116:9: error: 'a' was not declared in this scope
  116 |         a=(a*rhs.inverse().a)%MOD;

ソースコード

#pragma GCC optimize("Ofast")
#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include <map>
#include <set>
#include <tuple>
#include <iomanip>
#include <functional>
#include <complex>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef pair<ll,ll> pll;

template<class T,class U>constexpr bool chmin(T&a,const U b){if(a<=b)return false;a=b;return true;}
template<class T,class U>constexpr bool chmax(T&a,const U b){if(a>=b)return false;a=b;return true;}
#define bit(n,k) ( (n>>k)&1 )

//デバッグ
template<class T>
void Vout(vector<T> &V){
    cout<<"\nstart\n";
    const int sz=V.size();
    for(int i=0;i<sz;i++){
        cout<<i<<" "<<V[i]<<'\n';
    }
    cout<<"end\n"<<endl;
}

template<class T>
void VPout(vector<T> &V){
    cout<<"\nstart\n";
    const int sz=V.size();
    for(int i=0;i<sz;i++){
        cout<<i<<" "<<V[i].first<<" "<<V[i].second<<'\n';
    }
    cout<<"end\n"<<endl;
}


//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


constexpr int MAX=1<<30;
constexpr ll INF=1LL<<62;
constexpr int MOD=1e9+7;
int dx[]={1,-1,0,0},dy[]={0,0,-1,1};

//__builtin_popcount(S);
//#define int ll
//vector<vector<int>> data(3, vector<int>(4));
//vector.resize(a,vector<int>(b,-1));
//vector<vector<vector<要素の型>>> 変数名(要素数1, vector<vector<要素の型>>(要素数2, vector<要素の型>(要素数3, 初期値)));

struct ModInt{
    using u64=uint_fast64_t;
    u64 a;
    constexpr ModInt() :a(0){}
    constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}

    inline constexpr ModInt operator+(const ModInt rhs)const noexcept{
        return ModInt(*this)+=rhs;
    }
    inline constexpr ModInt operator-(const ModInt rhs)const noexcept{
        return ModInt(*this)-=rhs;
    }
    inline constexpr ModInt operator*(const ModInt rhs)const noexcept{
        return ModInt(*this)*=rhs;
    }
    inline constexpr ModInt operator/(const ModInt rhs)const noexcept{
        return ModInt(*this)/=rhs;
    }
    inline constexpr ModInt operator+(const ll rhs) const noexcept{
        return ModInt(*this)+=rhs;
    }
    inline constexpr ModInt operator-(const ll rhs)const noexcept{
        return ModInt(*this)-=rhs;
    }
    inline constexpr ModInt operator*(const ll rhs)const noexcept{
        return ModInt(*this)*=rhs;
    }
    inline constexpr ModInt operator/(const ll rhs)const noexcept{
        return ModInt(*this)/=rhs;
    }

    inline constexpr ModInt &operator+=(const ModInt rhs)noexcept{
        a+=rhs.a;
        if(a>=MOD) a-=MOD;
        return *this;
    }
    inline constexpr ModInt &operator-=(const ModInt rhs)noexcept{
        if(rhs.a>a) a+=MOD;
        a-=rhs.a;
        return *this;
    }
    inline constexpr ModInt &operator*=(const ModInt rhs)noexcept{
        a=(a*rhs.a)%MOD;
        return *this;
    }
    inline constexpr ModInt &operator/=(ModInt rhs)noexcept{
        a=(a*rhs.inverse().a)%MOD;
        return *this;
    }
    inline constexpr ModInt &operator+=(const ll rhs)noexcept{
        a+=rhs;
        if(a>=MOD) a-=MOD;
        return *this;
    }
    inline constexpr ModInt &operator-=(const ll rhs)noexcept{
        if(rhs>a) a+=MOD;
        a-=rhs;
        return *this;
    }
    inline constexpr ModInt &operator*=(const ll rhs)noexcept{
        a=(a*rhs)%MOD;
        return *this;
    }
    inline constexpr ModInt &operator/=(ll rhs)noexcept{
        a=(a*ModInt(rhs).inverse().a)%MOD;
        return *this;
    }

    inline constexpr ModInt operator=(ll x)noexcept{
        x%=MOD;
        if(x<0) x+=MOD;
        a=x;
        return *this;
    }

    inline constexpr bool operator==(const ModInt p)const noexcept{
        return a==p.a;
    }

    inline constexpr bool operator!=(const ModInt p)const noexcept{
        return a!=p.a;
    }

    inline constexpr ModInt pow(ll N) const noexcept{
        ModInt ans(1LL),p(a);
        while(N>0){
            if(bit(N,0)){
                ans*=p;
            }
            p*=p;
            N>>=1;
        }
        return ans;
    }
    inline constexpr ModInt inverse() const noexcept{
        return pow(MOD-2);
    }

};
inline constexpr ModInt operator+(const ll &a,const ModInt &b)noexcept{
    return ModInt(a)+=b;
}
inline constexpr ModInt operator-(const ll &a,const ModInt &b)noexcept{
    return ModInt(a)-=b;
}
inline constexpr ModInt operator*(const ll &a,const ModInt &b)noexcept{
    return ModInt(a)*=b;
}
inline constexpr ModInt operator/(const ll &a,const ModInt &b)noexcept{
    return ModInt(a)/=b;
}


inline constexpr ModInt Mr(ll p){
    p%=MOD;
    if(p<0) p+=MOD;
    return ModInt(p);
}

struct Binominal{
    vector<ModInt> fac,finv,inv; //fac[n]:n! finv:(n!)の逆元
    int sz;
    Binominal(int n=10) :sz(0){
        init(n);
    }
    inline void init(int n){
        fac.resize(n+1,1);
        finv.resize(n+1,1);
        inv.resize(n+1,1);
        for(int i=2;i<=n;i++){
            fac[i]=fac[i-1]*i;
            inv[i]=MOD-inv[MOD%i]*(MOD/i);
            finv[i]=finv[i-1]*inv[i];
        }
        sz=n;
    }
    //nCk(n,k<=N) をO(1)で求める
    inline ModInt com(int n,int k){
        if(n<k) return ModInt(0);
        if(n<0 || k<0) return ModInt(0);
        if(n>sz) init(n);
        return fac[n]*finv[k]*finv[n-k];
    }
    //nCk(k<=N) をO(k)　で求める 
    inline ModInt rcom(ll n,int k){
        if(n<0 || k<0 || n<k) return ModInt(0);
        if(k>sz) init(k);
        ModInt ret(1);
        for(int i=0;i<k;i++){
            ret*=(n-i);
        }
        ret*=finv[k];
        return ret;
    }

    //重複組み合わせ n種類のものから重複を許してk個を選ぶ
    //〇がn個,|がk個
    inline ModInt h(int n,int k){
        return com(n+k-1,k);
    }
};
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr); 
    cout<<fixed<<setprecision(10);
 
    int a,b,c;
    cin>>a>>b>>c;
    int sum=a+b+c;
    ModInt ans(0),co(0);
    vector<ModInt> t(310000);
    t[0]=1;
    for(int i=1;i<310000;i++){
        t[i]=t[i-1]*2;
    }
    for(int i=1;i<310000;i++){
        t[i]+=t[i-1];
    }
    Binominal B;
    for(int i=1;i<=a;i++){
        int sum=a-i+b-1+c;
        co=B.com(sum,c)*B.com(sum-c,b-1);
        ans+=co*c/sum*t[sum-1];
    }
    cout<<ans.a<<endl;
}