Submission #3381130


Source Code Expand

#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{
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(int k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }
  
  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-(){return v?MOD-v:v;}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}

  static vector<Mint> fact,finv,invs;
  
  static void init(int n){
    if(n+1<=(signed)fact.size()) return;
    fact.assign(n+1,1);
    finv.assign(n+1,1);
    invs.assign(n+1,1);
    
    for(int i=1;i<=n;i++) fact[i]=fact[i-1]*Mint(i);
    finv[n]=Mint(1)/fact[n];
    for(int i=n;i>=1;i--) finv[i-1]=finv[i]*Mint(i);
    for(int i=1;i<=n;i++) invs[i]=finv[i]*fact[i-1];
  }

  static Mint comb(long long n,int k){
    Mint res(1);
    for(int i=0;i<k;i++){
      res*=Mint(n-i);
      res/=Mint(i+1);
    }
    return res;
  }
  
  static Mint C(int n,int k){
    if(n<k||k<0) return Mint(0);
    init(n);
    return fact[n]*finv[n-k]*finv[k];
  }

  static Mint P(int n,int k){
    if(n<k||k<0) return Mint(0);
    init(n);
    return fact[n]*finv[n-k];
  }
  
  static Mint H(int n,int k){
    if(n<0||k<0) return Mint(0);
    if(!n&&!k) return Mint(1);
    init(n+k-1);
    return C(n+k-1,n);
  }

  static Mint S(int n,int k){
    Mint res;
    init(k);
    for(int i=1;i<=k;i++){
      Mint tmp=C(k,i)*Mint(i).pow(n);
      if((k-i)&1) res-=tmp;
      else res+=tmp;
    }    
    return res*=finv[k];
  }

  static vector<vector<Mint> > D(int n,int m){
    vector<vector<Mint> > dp(n+1,vector<Mint>(m+1,0));
    dp[0][0]=Mint(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 Mint B(int n,int k){
    Mint res;
    for(int j=1;j<=k;j++) res+=S(n,j);
    return res;
  }

  static Mint montmort(int n){
    Mint 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 Mint LagrangePolynomial(vector<Mint> &y,Mint t){
    int n=y.size()-1;
    init(n+1);
    Mint num(1);
    for(int i=0;i<=n;i++) num*=t-Mint(i);
    Mint res;
    for(int i=0;i<=n;i++){
      Mint tmp=y[i]*num/(t-Mint(i))*finv[i]*finv[n-i];
      if((n-i)&1) res-=tmp;
      else res+=tmp;
    }
    return res;
  }
};
template<typename T,T MOD>
vector<Mint<T, MOD> > Mint<T, MOD>::fact = vector<Mint<T, MOD> >();
template<typename T,T MOD>
vector<Mint<T, MOD> > Mint<T, MOD>::finv = vector<Mint<T, MOD> >();
template<typename T,T MOD>
vector<Mint<T, MOD> > Mint<T, MOD>::invs = vector<Mint<T, MOD> >();

//INSERT ABOVE HERE
signed main(){
  int n,d;
  cin>>n>>d;
  vector<int> a(n);
  for(int i=0;i<n;i++) cin>>a[i];

  using M = Mint<int>;
  M::init(1e5);

  const int MAX = min(1000, d+1);
  vector<vector<M> > dp(n+1,vector<M>(MAX));
  dp[0][0]=1;
  for(int t=0;t<n;t++)
    for(int i=n-1;i>=0;i--)
      for(int j=0;j<MAX;j++)
	for(int k=0;k<a[t];k++)
	  if(j+k<MAX) dp[i+1][j+k]+=dp[i][j]*M::finv[k];

  vector<M> co(MAX);
  for(int i=0;i<MAX;i++) co[i]=M::comb(d,i)*M::fact[i];
  
  M ans;
  for(int i=0;i<=n;i++)
    for(int j=0;j<MAX;j++)
      ans+=M(i&1?-1LL:1LL)*dp[i][j]*M(n-i).pow(d-j)*co[j];

  cout<<ans.v<<endl;
  return 0;
}

Submission Info

Submission Time
Task D - 天下一ボディービルコンテスト
User beet
Language C++14 (GCC 5.4.1)
Score 280
Code Size 4256 Byte
Status AC
Exec Time 192 ms
Memory 1536 KB

Judge Result

Set Name level1 level2 level3
Score / Max Score 40 / 40 100 / 100 140 / 140
Status
AC × 27
AC × 50
AC × 74
Set Name Test Cases
level1 level1_max_0.txt, level1_maxrand_0.txt, level1_maxrand_1.txt, level1_maxrand_2.txt, level1_maxrand_3.txt, level1_maxrand_4.txt, level1_maxrand_5.txt, level1_maxrand_6.txt, level1_maxrand_7.txt, level1_maxrand_8.txt, level1_maxrand_9.txt, level1_min1_0.txt, level1_min2_0.txt, level1_min3_0.txt, level1_min4_0.txt, level1_rand_0.txt, level1_rand_1.txt, level1_rand_2.txt, level1_rand_3.txt, level1_rand_4.txt, level1_rand_5.txt, level1_rand_6.txt, level1_rand_7.txt, level1_rand_8.txt, level1_rand_9.txt, level1_sample1.txt, level1_sample2.txt
level2 level1_max_0.txt, level1_maxrand_0.txt, level1_maxrand_1.txt, level1_maxrand_2.txt, level1_maxrand_3.txt, level1_maxrand_4.txt, level1_maxrand_5.txt, level1_maxrand_6.txt, level1_maxrand_7.txt, level1_maxrand_8.txt, level1_maxrand_9.txt, level1_min1_0.txt, level1_min2_0.txt, level1_min3_0.txt, level1_min4_0.txt, level1_rand_0.txt, level1_rand_1.txt, level1_rand_2.txt, level1_rand_3.txt, level1_rand_4.txt, level1_rand_5.txt, level1_rand_6.txt, level1_rand_7.txt, level1_rand_8.txt, level1_rand_9.txt, level1_sample1.txt, level1_sample2.txt, level2_max_0.txt, level2_maxrand_0.txt, level2_maxrand_1.txt, level2_maxrand_2.txt, level2_maxrand_3.txt, level2_maxrand_4.txt, level2_maxrand_5.txt, level2_maxrand_6.txt, level2_maxrand_7.txt, level2_maxrand_8.txt, level2_maxrand_9.txt, level2_min1_0.txt, level2_min2_0.txt, level2_rand_0.txt, level2_rand_1.txt, level2_rand_2.txt, level2_rand_3.txt, level2_rand_4.txt, level2_rand_5.txt, level2_rand_6.txt, level2_rand_7.txt, level2_rand_8.txt, level2_rand_9.txt
level3 level1_max_0.txt, level1_maxrand_0.txt, level1_maxrand_1.txt, level1_maxrand_2.txt, level1_maxrand_3.txt, level1_maxrand_4.txt, level1_maxrand_5.txt, level1_maxrand_6.txt, level1_maxrand_7.txt, level1_maxrand_8.txt, level1_maxrand_9.txt, level1_min1_0.txt, level1_min2_0.txt, level1_min3_0.txt, level1_min4_0.txt, level1_rand_0.txt, level1_rand_1.txt, level1_rand_2.txt, level1_rand_3.txt, level1_rand_4.txt, level1_rand_5.txt, level1_rand_6.txt, level1_rand_7.txt, level1_rand_8.txt, level1_rand_9.txt, level1_sample1.txt, level1_sample2.txt, level2_max_0.txt, level2_maxrand_0.txt, level2_maxrand_1.txt, level2_maxrand_2.txt, level2_maxrand_3.txt, level2_maxrand_4.txt, level2_maxrand_5.txt, level2_maxrand_6.txt, level2_maxrand_7.txt, level2_maxrand_8.txt, level2_maxrand_9.txt, level2_min1_0.txt, level2_min2_0.txt, level2_rand_0.txt, level2_rand_1.txt, level2_rand_2.txt, level2_rand_3.txt, level2_rand_4.txt, level2_rand_5.txt, level2_rand_6.txt, level2_rand_7.txt, level2_rand_8.txt, level2_rand_9.txt, level3_max_0.txt, level3_maxrand_0.txt, level3_maxrand_1.txt, level3_maxrand_2.txt, level3_maxrand_3.txt, level3_maxrand_4.txt, level3_maxrand_5.txt, level3_maxrand_6.txt, level3_maxrand_7.txt, level3_maxrand_8.txt, level3_maxrand_9.txt, level3_min1_0.txt, level3_min2_0.txt, level3_rand_0.txt, level3_rand_1.txt, level3_rand_2.txt, level3_rand_3.txt, level3_rand_4.txt, level3_rand_5.txt, level3_rand_6.txt, level3_rand_7.txt, level3_rand_8.txt, level3_rand_9.txt, level3_sample3.txt
Case Name Status Exec Time Memory
level1_max_0.txt AC 24 ms 1408 KB
level1_maxrand_0.txt AC 23 ms 1408 KB
level1_maxrand_1.txt AC 23 ms 1408 KB
level1_maxrand_2.txt AC 23 ms 1408 KB
level1_maxrand_3.txt AC 23 ms 1408 KB
level1_maxrand_4.txt AC 23 ms 1408 KB
level1_maxrand_5.txt AC 23 ms 1408 KB
level1_maxrand_6.txt AC 23 ms 1408 KB
level1_maxrand_7.txt AC 24 ms 1408 KB
level1_maxrand_8.txt AC 23 ms 1408 KB
level1_maxrand_9.txt AC 23 ms 1408 KB
level1_min1_0.txt AC 23 ms 1408 KB
level1_min2_0.txt AC 23 ms 1408 KB
level1_min3_0.txt AC 3 ms 1408 KB
level1_min4_0.txt AC 3 ms 1408 KB
level1_rand_0.txt AC 21 ms 1408 KB
level1_rand_1.txt AC 21 ms 1408 KB
level1_rand_2.txt AC 10 ms 1408 KB
level1_rand_3.txt AC 20 ms 1408 KB
level1_rand_4.txt AC 9 ms 1408 KB
level1_rand_5.txt AC 13 ms 1408 KB
level1_rand_6.txt AC 7 ms 1408 KB
level1_rand_7.txt AC 5 ms 1408 KB
level1_rand_8.txt AC 3 ms 1408 KB
level1_rand_9.txt AC 8 ms 1408 KB
level1_sample1.txt AC 3 ms 1408 KB
level1_sample2.txt AC 3 ms 1408 KB
level2_max_0.txt AC 84 ms 1408 KB
level2_maxrand_0.txt AC 84 ms 1408 KB
level2_maxrand_1.txt AC 84 ms 1408 KB
level2_maxrand_2.txt AC 84 ms 1408 KB
level2_maxrand_3.txt AC 84 ms 1408 KB
level2_maxrand_4.txt AC 84 ms 1408 KB
level2_maxrand_5.txt AC 84 ms 1408 KB
level2_maxrand_6.txt AC 84 ms 1408 KB
level2_maxrand_7.txt AC 84 ms 1408 KB
level2_maxrand_8.txt AC 84 ms 1408 KB
level2_maxrand_9.txt AC 85 ms 1408 KB
level2_min1_0.txt AC 84 ms 1408 KB
level2_min2_0.txt AC 83 ms 1408 KB
level2_rand_0.txt AC 84 ms 1408 KB
level2_rand_1.txt AC 83 ms 1408 KB
level2_rand_2.txt AC 83 ms 1408 KB
level2_rand_3.txt AC 84 ms 1408 KB
level2_rand_4.txt AC 84 ms 1408 KB
level2_rand_5.txt AC 84 ms 1408 KB
level2_rand_6.txt AC 84 ms 1408 KB
level2_rand_7.txt AC 83 ms 1408 KB
level2_rand_8.txt AC 83 ms 1408 KB
level2_rand_9.txt AC 83 ms 1408 KB
level3_max_0.txt AC 192 ms 1536 KB
level3_maxrand_0.txt AC 139 ms 1536 KB
level3_maxrand_1.txt AC 130 ms 1536 KB
level3_maxrand_2.txt AC 130 ms 1536 KB
level3_maxrand_3.txt AC 135 ms 1536 KB
level3_maxrand_4.txt AC 129 ms 1536 KB
level3_maxrand_5.txt AC 141 ms 1536 KB
level3_maxrand_6.txt AC 140 ms 1536 KB
level3_maxrand_7.txt AC 132 ms 1536 KB
level3_maxrand_8.txt AC 136 ms 1536 KB
level3_maxrand_9.txt AC 129 ms 1536 KB
level3_min1_0.txt AC 91 ms 1536 KB
level3_min2_0.txt AC 84 ms 1408 KB
level3_rand_0.txt AC 115 ms 1536 KB
level3_rand_1.txt AC 108 ms 1536 KB
level3_rand_2.txt AC 84 ms 1408 KB
level3_rand_3.txt AC 95 ms 1536 KB
level3_rand_4.txt AC 84 ms 1408 KB
level3_rand_5.txt AC 95 ms 1536 KB
level3_rand_6.txt AC 93 ms 1536 KB
level3_rand_7.txt AC 103 ms 1536 KB
level3_rand_8.txt AC 88 ms 1408 KB
level3_rand_9.txt AC 86 ms 1408 KB
level3_sample3.txt AC 88 ms 1536 KB