結果
| 問題 | No.895 MESE |
| ユーザー |
 beet
|
| 提出日時 | 2019-09-27 21:42:04 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 52 ms / 2,000 ms |
| コード長 | 5,067 bytes |
| コンパイル時間 | 2,009 ms |
| コンパイル使用メモリ | 197,408 KB |
| 最終ジャッジ日時 | 2025-01-07 19:22:52 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
ソースコード
#include<bits/stdc++.h>using namespace std;using Int = long long;template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}template<typename T,T MOD = 1000000007>struct Mint{static constexpr T mod = MOD;T v;Mint():v(0){}Mint(signed v):v(v){}Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}Mint pow(long long k){Mint res(1),tmp(v);while(k){if(k&1) res*=tmp;tmp*=tmp;k>>=1;}return res;}static Mint add_identity(){return Mint(0);}static Mint mul_identity(){return Mint(1);}Mint inv(){return pow(MOD-2);}Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}Mint& operator/=(Mint a){return (*this)*=a.inv();}Mint operator+(Mint a) const{return Mint(v)+=a;};Mint operator-(Mint a) const{return Mint(v)-=a;};Mint operator*(Mint a) const{return Mint(v)*=a;};Mint operator/(Mint a) const{return Mint(v)/=a;};Mint operator-() const{return v?Mint(MOD-v):Mint(v);}bool operator==(const Mint a)const{return v==a.v;}bool operator!=(const Mint a)const{return v!=a.v;}bool operator <(const Mint a)const{return v <a.v;}// find x s.t. a^x = bstatic T log(T a,T b){const T sq=40000;unordered_map<T, T> dp;dp.reserve(sq);Mint res(1);for(int r=0;r<sq;r++){if(!dp.count(res.v)) dp[res.v]=r;res*=a;}Mint p=Mint(a).inv().pow(sq);res=b;for(int q=0;q<=MOD/sq+1;q++){if(dp.count(res.v)){T idx=q*sq+dp[res.v];if(idx>0) return idx;}res*=p;}assert(0);return T(-1);}static Mint comb(long long n,int k){Mint num(1),dom(1);for(int i=0;i<k;i++){num*=Mint(n-i);dom*=Mint(i+1);}return num/dom;}};template<typename T,T MOD> constexpr T Mint<T, MOD>::mod;template<typename T,T MOD>ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}template<typename M>class Enumeration{private:static vector<M> fact,finv,invs;public:static void init(int n){n=min<decltype(M::mod)>(n,M::mod-1);int m=fact.size();if(n<m) return;fact.resize(n+1,1);finv.resize(n+1,1);invs.resize(n+1,1);if(m==0) m=1;for(int i=m;i<=n;i++) fact[i]=fact[i-1]*M(i);finv[n]=M(1)/fact[n];for(int i=n;i>=m;i--) finv[i-1]=finv[i]*M(i);for(int i=m;i<=n;i++) invs[i]=finv[i]*fact[i-1];}static M Fact(int n){init(n);return fact[n];}static M Finv(int n){init(n);return finv[n];}static M Invs(int n){init(n);return invs[n];}static M C(int n,int k){if(n<k||k<0) return M(0);init(n);return fact[n]*finv[n-k]*finv[k];}static M P(int n,int k){if(n<k||k<0) return M(0);init(n);return fact[n]*finv[n-k];}static M H(int n,int k){if(n<0||k<0) return M(0);if(!n&&!k) return M(1);init(n+k-1);return C(n+k-1,k);}static M S(int n,int k){M res;init(k);for(int i=1;i<=k;i++){M tmp=C(k,i)*M(i).pow(n);if((k-i)&1) res-=tmp;else res+=tmp;}return res*=finv[k];}static vector<vector<M> > D(int n,int m){vector<vector<M> > dp(n+1,vector<M>(m+1,0));dp[0][0]=M(1);for(int i=0;i<=n;i++){for(int j=1;j<=m;j++){if(i-j>=0) dp[i][j]=dp[i][j-1]+dp[i-j][j];else dp[i][j]=dp[i][j-1];}}return dp;}static M B(int n,int k){if(n==0) return M(1);k=min(k,n);init(k);vector<M> dp(k+1);dp[0]=M(1);for(int i=1;i<=k;i++)dp[i]=dp[i-1]+((i&1)?-finv[i]:finv[i]);M res;for(int i=1;i<=k;i++)res+=M(i).pow(n)*finv[i]*dp[k-i];return res;}static M montmort(int n){M res;init(n);for(int k=2;k<=n;k++){if(k&1) res-=finv[k];else res+=finv[k];}return res*=fact[n];}static M LagrangePolynomial(vector<M> &y,M t){int n=y.size()-1;if(t.v<=n) return y[t.v];init(n+1);vector<M> dp(n+1,1),pd(n+1,1);for(int i=0;i<n;i++) dp[i+1]=dp[i]*(t-M(i));for(int i=n;i>0;i--) pd[i-1]=pd[i]*(t-M(i));M res{0};for(int i=0;i<=n;i++){M tmp=y[i]*dp[i]*pd[i]*finv[i]*finv[n-i];if((n-i)&1) res-=tmp;else res+=tmp;}return res;}};template<typename M>vector<M> Enumeration<M>::fact = vector<M>();template<typename M>vector<M> Enumeration<M>::finv = vector<M>();template<typename M>vector<M> Enumeration<M>::invs = vector<M>();//INSERT ABOVE HEREsigned main(){int a,b,c;cin>>a>>b>>c;using M = Mint<int>;using E = Enumeration<M>;E::init(1e6);int s=a+b+c;M ans{0};for(int i=1;i<=a;i++){M res=E::Fact(s-(i+1))*E::Finv(a-i)*E::Finv(b-1)*E::Finv(c);M sum=M(2).pow(s-(i+1))-M(1);M prb=M(c)/M(s-(i+1));ans+=res*sum*prb;}cout<<ans<<endl;return 0;}