結果

問題 No.389 ロジックパズルの組み合わせ
ユーザー LayCurseLayCurse
提出日時 2016-07-08 22:37:50
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 49 ms / 2,000 ms
コード長 3,353 bytes
コンパイル時間 2,988 ms
コンパイル使用メモリ 146,996 KB
実行使用メモリ 15,396 KB
最終ジャッジ日時 2023-08-03 07:00:48
合計ジャッジ時間 6,246 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 16 ms
13,660 KB
testcase_01 AC 17 ms
13,616 KB
testcase_02 AC 16 ms
13,648 KB
testcase_03 AC 17 ms
13,924 KB
testcase_04 AC 16 ms
13,792 KB
testcase_05 AC 16 ms
13,632 KB
testcase_06 AC 17 ms
13,756 KB
testcase_07 AC 16 ms
13,796 KB
testcase_08 AC 16 ms
13,724 KB
testcase_09 AC 19 ms
13,900 KB
testcase_10 AC 18 ms
13,740 KB
testcase_11 AC 20 ms
13,820 KB
testcase_12 AC 18 ms
13,784 KB
testcase_13 AC 29 ms
14,360 KB
testcase_14 AC 21 ms
13,896 KB
testcase_15 AC 18 ms
13,896 KB
testcase_16 AC 18 ms
13,860 KB
testcase_17 AC 20 ms
13,872 KB
testcase_18 AC 38 ms
14,964 KB
testcase_19 AC 16 ms
13,792 KB
testcase_20 AC 16 ms
13,632 KB
testcase_21 AC 16 ms
13,680 KB
testcase_22 AC 17 ms
13,760 KB
testcase_23 AC 17 ms
13,616 KB
testcase_24 AC 16 ms
13,636 KB
testcase_25 AC 16 ms
13,792 KB
testcase_26 AC 16 ms
13,796 KB
testcase_27 AC 16 ms
13,636 KB
testcase_28 AC 17 ms
13,664 KB
testcase_29 AC 16 ms
13,756 KB
testcase_30 AC 16 ms
13,628 KB
testcase_31 AC 16 ms
13,756 KB
testcase_32 AC 16 ms
13,656 KB
testcase_33 AC 17 ms
13,760 KB
testcase_34 AC 17 ms
13,684 KB
testcase_35 AC 15 ms
13,792 KB
testcase_36 AC 16 ms
13,640 KB
testcase_37 AC 16 ms
13,636 KB
testcase_38 AC 16 ms
13,632 KB
testcase_39 AC 16 ms
13,672 KB
testcase_40 AC 16 ms
13,668 KB
testcase_41 AC 16 ms
13,636 KB
testcase_42 AC 16 ms
13,656 KB
testcase_43 AC 16 ms
13,740 KB
testcase_44 AC 16 ms
13,724 KB
testcase_45 AC 17 ms
13,688 KB
testcase_46 AC 16 ms
13,644 KB
testcase_47 AC 16 ms
13,624 KB
testcase_48 AC 16 ms
13,632 KB
testcase_49 AC 40 ms
14,944 KB
testcase_50 AC 17 ms
13,696 KB
testcase_51 AC 17 ms
13,860 KB
testcase_52 AC 20 ms
13,832 KB
testcase_53 AC 18 ms
13,796 KB
testcase_54 AC 21 ms
13,936 KB
testcase_55 AC 16 ms
13,704 KB
testcase_56 AC 17 ms
13,736 KB
testcase_57 AC 26 ms
14,232 KB
testcase_58 AC 36 ms
14,852 KB
testcase_59 AC 32 ms
14,452 KB
testcase_60 AC 23 ms
14,084 KB
testcase_61 AC 49 ms
15,396 KB
testcase_62 AC 23 ms
14,052 KB
testcase_63 AC 37 ms
14,728 KB
testcase_64 AC 21 ms
13,960 KB
testcase_65 AC 18 ms
13,956 KB
testcase_66 AC 21 ms
14,076 KB
testcase_67 AC 21 ms
13,936 KB
testcase_68 AC 21 ms
14,052 KB
testcase_69 AC 16 ms
13,736 KB
testcase_70 AC 16 ms
13,632 KB
testcase_71 AC 16 ms
13,616 KB
testcase_72 AC 16 ms
13,732 KB
testcase_73 AC 15 ms
13,640 KB
testcase_74 AC 15 ms
13,640 KB
testcase_75 AC 15 ms
13,724 KB
testcase_76 AC 16 ms
13,648 KB
testcase_77 AC 15 ms
13,636 KB
testcase_78 AC 16 ms
13,716 KB
testcase_79 AC 16 ms
13,636 KB
testcase_80 AC 17 ms
13,640 KB
testcase_81 AC 16 ms
13,632 KB
testcase_82 AC 16 ms
13,760 KB
testcase_83 AC 15 ms
13,640 KB
testcase_84 AC 15 ms
13,620 KB
testcase_85 AC 15 ms
13,668 KB
testcase_86 AC 15 ms
13,696 KB
testcase_87 AC 16 ms
13,716 KB
testcase_88 AC 15 ms
13,628 KB
testcase_89 AC 23 ms
14,032 KB
testcase_90 AC 29 ms
14,448 KB
testcase_91 AC 38 ms
15,148 KB
testcase_92 AC 19 ms
13,964 KB
testcase_93 AC 29 ms
14,692 KB
testcase_94 AC 16 ms
13,800 KB
testcase_95 AC 30 ms
14,536 KB
testcase_96 AC 25 ms
14,324 KB
testcase_97 AC 26 ms
14,328 KB
testcase_98 AC 22 ms
13,888 KB
権限があれば一括ダウンロードができます

ソースコード

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 combination{
  int *f,*v,m,s;unsigned **d;
  void* init(void *mem, int md, int lim=1000100, int small=0){int i,j;m=md;s=small;f=(int*)mem;v=f+lim;d=(unsigned**)(v+lim);d[0]=(unsigned*)(d+s);REP(i,1,s)d[i]=d[i-1]+s;mem=(void*)(d[0]+s*s);if(lim){f[0]=1;REP(i,1,lim)f[i]=(ll)f[i-1]*i%m;v[lim-1]=get_inv(f[lim-1],m);for(i=lim-1;i;i--)v[i-1]=(ll)v[i]*i%m;}REP(i,1,s)d[0][i]=0;rep(i,s)d[i][0]=1;REP(i,1,s)REP(j,1,s){d[i][j]=d[i-1][j-1]+d[i-1][j];if(d[i][j]>=m)d[i][j]-=m;}return mem;}
  ll C(int a, int b){if(b<0||b>a)return 0;if(a<s)return d[a][b];return (ll)f[a]*v[b]%m*v[a-b]%m;}
  ll P(int a, int b){if(b<0||b>a)return 0;return (ll)f[a]*v[a-b]%m;}
  ll H(int a, int b){if(a==0&&b==0)return 1;if(a<=0||b<0)return 0;return C(a+b-1,b);}
};

int M, K, H[1000000];

int main(){
  int i, j, k;
  int all;
  combination comb;

  mem = comb.init(mem, MD);

  reader(&M);
  K = 0;
  for(;;){
    if(scanf("%d",H+K)!=1) break;
    K++;
  }
  if(K==1 && H[0]==0){
    writerLn(1);
    return 0;
  }

  rep(i,K) M -= H[i]+1;
  M++;

  if(M < 0){
    writerLn("NA");
  } else {
    writerLn(comb.H(K+1, M));
  }

  return 0;
}
0