結果

問題 No.329 全射
ユーザー LayCurseLayCurse
提出日時 2015-12-22 00:37:34
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 43 ms / 2,000 ms
コード長 6,636 bytes
コンパイル時間 1,713 ms
コンパイル使用メモリ 163,612 KB
実行使用メモリ 11,324 KB
最終ジャッジ日時 2024-09-18 18:14:39
合計ジャッジ時間 3,356 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
9,928 KB
testcase_01 AC 19 ms
9,828 KB
testcase_02 AC 20 ms
9,704 KB
testcase_03 AC 20 ms
10,784 KB
testcase_04 AC 19 ms
9,656 KB
testcase_05 AC 19 ms
9,808 KB
testcase_06 AC 19 ms
9,672 KB
testcase_07 AC 18 ms
9,728 KB
testcase_08 AC 19 ms
9,672 KB
testcase_09 AC 19 ms
9,552 KB
testcase_10 AC 19 ms
10,588 KB
testcase_11 AC 20 ms
10,876 KB
testcase_12 AC 20 ms
10,548 KB
testcase_13 AC 36 ms
10,668 KB
testcase_14 AC 31 ms
10,872 KB
testcase_15 AC 28 ms
9,732 KB
testcase_16 AC 30 ms
9,988 KB
testcase_17 AC 33 ms
10,964 KB
testcase_18 AC 34 ms
9,960 KB
testcase_19 AC 43 ms
10,700 KB
testcase_20 AC 40 ms
10,604 KB
testcase_21 AC 36 ms
10,928 KB
testcase_22 AC 42 ms
9,800 KB
testcase_23 AC 25 ms
11,128 KB
testcase_24 AC 25 ms
9,816 KB
testcase_25 AC 29 ms
11,024 KB
testcase_26 AC 26 ms
9,768 KB
testcase_27 AC 21 ms
11,324 KB
testcase_28 AC 19 ms
9,932 KB
testcase_29 AC 20 ms
9,744 KB
testcase_30 AC 19 ms
10,328 KB
testcase_31 AC 20 ms
9,936 KB
testcase_32 AC 20 ms
9,864 KB
testcase_33 AC 29 ms
10,704 KB
testcase_34 AC 28 ms
10,160 KB
testcase_35 AC 32 ms
10,448 KB
testcase_36 AC 31 ms
9,788 KB
testcase_37 AC 28 ms
10,060 KB
testcase_38 AC 30 ms
9,848 KB
testcase_39 AC 30 ms
10,012 KB
testcase_40 AC 34 ms
10,088 KB
testcase_41 AC 29 ms
9,944 KB
testcase_42 AC 33 ms
10,192 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void reader(double*)’:
main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   15 | void reader(double *x){scanf("%lf",x);}
      |                        ~~~~~^~~~~~~~~

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

int get_inv(ll a, int md){ll t=a,s=md,u=1,v=0,e;while(s){e=t/s;t-=e*s;u-=e*v;swap(t,s);swap(u,v);}if(u<0)u+=md;return u;}

struct mint{
  static unsigned md, W, R, Rinv, mdninv, RR;
  unsigned val;

  mint(){}mint(int a){val=mulR(a);}mint(unsigned a){val=mulR(a);}mint(ll a){val=mulR(a);}mint(ull a){val=mulR(a);}
  void setmod(unsigned m){int i;unsigned t;W=32;md=m;R=(1ULL<<W)%md;RR=(ull)R*R%md;switch(m){case 104857601:Rinv=2560000;mdninv=104857599;break;case 998244353:Rinv=232013824;mdninv=998244351;break;case 1000000007:Rinv=518424770;mdninv=2226617417U;break;case 1000000009:Rinv=171601999;mdninv=737024967;break;case 1004535809:Rinv=234947584;mdninv=1004535807;break;case 1007681537:Rinv=236421376;mdninv=1007681535;break;case 1012924417:Rinv=238887936;mdninv=1012924415;break;case 1045430273:Rinv=254466304;mdninv=1045430271;break;case 1051721729:Rinv=257538304;mdninv=1051721727;break;default:Rinv=get_inv(R,md);mdninv=0;t=0;rep(i,W){if(t%2==0)t+=md,mdninv|=(1U<<i);t/=2;}}}
  unsigned mulR(unsigned a){return(ull)a*R%md;}unsigned mulR(int a){if(a<0)a=a%md+md;return mulR((unsigned)a);}unsigned mulR(ull a){return mulR((unsigned)(a%md));}unsigned mulR(ll a){if(a<0)a=a%md+md;return mulR((unsigned)a);}
  unsigned reduce(unsigned T){unsigned m=T*mdninv;unsigned t=(unsigned)((T+(ull)m*md)>>W);if(t>=md)t-=md;return t;}unsigned reduce(ull T){unsigned m=(unsigned)T*mdninv;unsigned t=(unsigned)((T+(ull)m*md)>>W);if(t>=md)t-=md;return t;}
  unsigned get(){return reduce(val);}
  mint&operator+=(mint a){val+=a.val;if(val>=md)val-=md;return*this;}mint&operator-=(mint a){if(val<a.val)val=val+md-a.val;else val-=a.val;return*this;}mint&operator*=(mint a){val=reduce((ull)val*a.val);return*this;}mint&operator/=(mint a){return*this*=a.inverse();}
  mint operator+(mint a){return mint(*this)+=a;}mint operator-(mint a){return mint(*this)-=a;}mint operator*(mint a){return mint(*this)*=a;}mint operator/(mint a){return mint(*this)/=a;}
  mint operator+(int a){return mint(*this)+=mint(a);}mint operator-(int a){return mint(*this)-=mint(a);}mint operator*(int a){return mint(*this)*=mint(a);}mint operator/(int a){return mint(*this)/=mint(a);}
  mint operator+(ll a){return mint(*this)+=mint(a);}mint operator-(ll a){return mint(*this)-=mint(a);}mint operator*(ll a){return mint(*this)*=mint(a);}mint operator/(ll a){return mint(*this)/=mint(a);}
  mint operator-(void){mint res;if(val)res.val=md-val;else res.val=0;return res;}
  operator bool(void){return val!=0;}operator int(void){return get();}operator ll(void){return get();}
  mint inverse(){int a=val,b=md,u=1,v=0,t;mint r;while(b){t=a/b;a-=t*b;swap(a,b);u-=t*v;swap(u,v);}if(u<0)u+=md;r.val=(ull)u*RR%md;return r;}
  mint pw(ull b){mint a(*this),r;r.val=R;while(b){if(b&1)r*=a;b>>=1;a*=a;}return r;}
  bool operator==(int a){return get()==a;}
  bool operator!=(int a){return get()!=a;}
};
unsigned mint::md, mint::W, mint::R, mint::Rinv, mint::mdninv, mint::RR;
mint operator+(int a, mint b){return mint(a)+=b;}mint operator-(int a, mint b){return mint(a)-=b;}mint operator*(int a, mint b){return mint(a)*=b;}mint operator/(int a, mint b){return mint(a)/=b;}
mint operator+(ll a, mint b){return mint(a)+=b;}mint operator-(ll a, mint b){return mint(a)-=b;}mint operator*(ll a, mint b){return mint(a)*=b;}mint operator/(ll a, mint b){return mint(a)/=b;}

mint mval[10000], minv[10000];
void mint_init(int md=MD, mint val[]=mval, int vals=10000, mint inv[]=minv, int invs=10000){int i;val[0].setmod(md);val[0].val=0;REP(i,1,vals){val[i].val=val[i-1].val+mint::R;if(val[i].val >=md)val[i].val-=md;}inv[1].val=1;REP(i,2,invs){inv[i].val=md-((ll)(md/i)*inv[md%i].val%md);}REP(i,1,invs)inv[i].val=(ull)inv[i].val*mint::R%md;}


int N, M;
int W[222];
int S[50000], T[50000];

mint fac[1200];
mint dp[1200][1200];

int dist[222][222];

int main(){
  int i, j, k;
  mint res;

  mint_init();

  reader(&N,&M);
  rep(i,N) reader(W+i);
  rep(i,M) reader(S+i,T+i), S[i]--, T[i]--;

  fac[0] = mval[1];
  REP(i,1,1200) fac[i] = fac[i-1] * mval[i];

  rep(i,1200) dp[i][0] = mval[0];
  dp[0][0] = mval[1];
  REP(i,1,1200) REP(j,1,1200){
    dp[i][j] = dp[i-1][j-1] + j * dp[i-1][j];
  }

  rep(i,1200) rep(j,1200) dp[i][j] *= fac[j];

  rep(i,N) rep(j,N) dist[i][j] = 0;
  rep(i,N) dist[i][i] = W[i];
  rep(i,M) dist[S[i]][T[i]] = min(W[S[i]], W[T[i]]);
  rep(k,N) rep(i,N) rep(j,N) dist[i][j] = max(dist[i][j], min(dist[i][k], dist[k][j]));


  res = mval[0];
  rep(i,N) rep(j,N){
    if(dist[i][j]==W[j]) res += dp[W[i]][dist[i][j]];
  }

  writerLn((int)res);

  return 0;
}
0