#22453 (C++11) No.194 フィボナッチ数列の理解(1)

提出ソース

結果

問題	No.194 フィボナッチ数列の理解(1)
ユーザー	LayCurse
提出日時	2015-04-26 22:37:26
言語	C++11 (gcc 11.4.0)
結果	MLE
実行時間	-
コード長	5,963 bytes
コンパイル時間	1,658 ms
コンパイル使用メモリ	163,768 KB
実行使用メモリ	814,128 KB
最終ジャッジ日時	2024-07-05 03:04:21
合計ジャッジ時間	3,378 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 7,492 KB
testcase_01	AC	2 ms 7,628 KB
testcase_02	AC	12 ms 6,944 KB
testcase_03	AC	3 ms 6,944 KB
testcase_04	AC	6 ms 6,944 KB
testcase_05	AC	5 ms 6,944 KB
testcase_06	AC	6 ms 6,940 KB
testcase_07	AC	8 ms 6,940 KB
testcase_08	AC	3 ms 6,944 KB
testcase_09	AC	7 ms 6,940 KB
testcase_10	AC	4 ms 6,940 KB
testcase_11	AC	4 ms 6,940 KB
testcase_12	AC	5 ms 6,944 KB
testcase_13	AC	3 ms 6,940 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	9 ms 6,940 KB
testcase_16	AC	8 ms 6,944 KB
testcase_17	AC	3 ms 6,944 KB
testcase_18	AC	9 ms 6,940 KB
testcase_19	AC	12 ms 6,944 KB
testcase_20	AC	2 ms 6,944 KB
testcase_21	MLE	-
testcase_22	--	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

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);}
      |                        ~~~~~^~~~~~~~~
main.cpp: In function ‘int main()’:
main.cpp:80:18: warning: ‘m’ may be used uninitialized [-Wmaybe-uninitialized]
   80 |     pw.pow(mt, K-m-N, mem);
      |                  ^

ソースコード

raw source code

#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');}

struct llModMatrix{
  int r, c, mod; ll limit; ll **data;
  void malloc(int r, int c, int mod){int i;this->r=r;this->c=c;this->mod=mod;limit=((1ULL<<63)-1)-(ull)(mod-1)*(mod-1);data=(ll**)std::malloc(sizeof(ll*)*r);data[0]=(ll*)std::malloc(sizeof(ll)*r*c);REP(i,1,r)data[i]=data[i-1]+c;}
  void* malloc(int r, int c, int mod, void *workMemory){int i;this->r=r;this->c=c;this->mod=mod;limit=((1ULL<<63)-1)-(ull)(mod-1)*(mod-1);data=(ll**)workMemory;data[0]=(ll*)(data+r);REP(i,1,r)data[i]=data[i-1]+c;return (void*)(data[0]+r*c);}
  void free(void){std::free(data[0]);std::free(data);}
  void setIdentity(){int i,j;rep(i,r)rep(j,c){data[i][j]=0;if(i==j)data[i][j]=1;}}
  void setZero(){int i,j;rep(i,r)rep(j,c)data[i][j]=0;}
  void operator=(llModMatrix &a){int i,j;r=a.r;c=a.c;rep(i,r)rep(j,c)data[i][j]=a.data[i][j];}
  void operator+=(llModMatrix &a){int i,j;rep(i,r)rep(j,c){data[i][j]+=a.data[i][j];if(data[i][j]>=mod)data[i][j]-=mod;if(data[i][j]<=-mod)data[i][j]+=mod;}}
  void operator-=(llModMatrix &a){int i,j;rep(i,r)rep(j,c){data[i][j]-=a.data[i][j];if(data[i][j]>=mod)data[i][j]-=mod;if(data[i][j]<=-mod)data[i][j]+=mod;}}
  void mixed(void){int i,j;rep(i,r)rep(j,c){if(data[i][j]<0)data[i][j]+=mod;if(data[i][j]&&rand()%2)data[i][j]-=mod;}}
  void add(llModMatrix &a, llModMatrix &b){int i,j;r=a.r;c=a.c;rep(i,r)rep(j,c){data[i][j]=a.data[i][j]+b.data[i][j];if(data[i][j]>=mod)data[i][j]-=mod;if(data[i][j]<=-mod)data[i][j]+=mod;}}
  void sub(llModMatrix &a, llModMatrix &b){int i,j;r=a.r;c=a.c;rep(i,r)rep(j,c){data[i][j]=a.data[i][j]-b.data[i][j];if(data[i][j]>=mod)data[i][j]-=mod;if(data[i][j]<=-mod)data[i][j]+=mod;}}
  void mul(llModMatrix &a, llModMatrix &b){int i,j,k;r=a.r;c=b.c;setZero();rep(i,r)rep(k,a.c)if(a.data[i][k])rep(j,c){data[i][j]+=a.data[i][k]*b.data[k][j];if(data[i][j]>=limit||data[i][j]<=-limit)data[i][j]%=mod;}rep(i,r)rep(j,c)if(data[i][j]>=mod||data[i][j]<=-mod)data[i][j]%=mod;}
  void pow(llModMatrix &a, ull b, void *workMemory){llModMatrix t1,t2;r=c=a.r;workMemory=t1.malloc(r,c,mod,workMemory);workMemory=t2.malloc(r,c,mod,workMemory);setIdentity();t1=a;while(b){if(b%2){t2=*this;this->mul(t2,t1);}t2.mul(t1,t1);t1=t2;b/=2;}}
};

struct llModMatrixFastPowVec{
  llModMatrix A[64]; int n, mod; ll limit,*s,*t;
  void* set(llModMatrix &m, void *mem, int mx=64){int i;n=m.r;mod=m.mod;limit=m.limit;rep(i,mx)mem=A[i].malloc(n,n,m.mod,mem);A[0]=m;REP(i,1,mx)A[i].mul(A[i-1],A[i-1]);s=(ll*)mem;t=s+n;return(void*)(t+n);}
  ll get(ull a, ll x[], ll res[]=NULL){int i,j,k,p=0;ll r=0;rep(i,n)s[i]=x[i];for(;a;p++,a/=2)if(a%2){rep(i,n)t[i]=0;rep(i,n)rep(j,n){t[i]+=A[p].data[i][j]*s[j];if(t[i]<-limit||t[i]>limit)t[i]%=mod;}rep(i,n)s[i]=t[i]%mod;}if(res!=NULL)rep(i,n)res[i]=s[i];rep(i,n)r+=s[i];r%=mod;if(r<0)r+=mod;return r;}
};


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

int N; ll K;
int A[20000], C[20000];
ll dp[2000000], sum[2000000];

int main(){
  int i, j, k, m;
  ll res1, res2;
  llModMatrix mt, pw;

  reader(&N,&K);
  rep(i,N) reader(A+i);
  if(K >= 1000000){
    mt.malloc(2*N,2*N,MD);
    pw.malloc(2*N,2*N,MD);
    res1 = res2 = 0;
    
    mt.setZero();
    rep(i,N-1) mt.data[i+1][i]++;
    rep(i,N) mt.data[0][i]++;
    rep(i,N) mt.data[N+i][N+i]++;
    rep(i,N) mt.data[i][N+i]++;
    
    pw.pow(mt, K-m-N, mem);
    rep(i,N) pw.data[0][N+i] += pw.data[0][i];
    REP(i,1,N) pw.data[0][N+i]++;
    
    rep(i,N){
      res1 += pw.data[0][i] * A[N-1-i];
      res2 += pw.data[0][N+i] * A[N-1-i];
    }

    res1 %= MD;
    res2 %= MD;
    if(res1 < 0) res1 += MD;
    if(res2 < 0) res2 += MD;
    writerLn(res1,res2);
  } else {
    rep(i,N) dp[i] = A[i];
    sum[0] = 0;
    rep(i,N) sum[i+1] = (sum[i]+A[i]) % MD;
    REP(i,N,K){
      dp[i] = (sum[i] - sum[i-N]) % MD;
      sum[i+1] = (sum[i] + dp[i]) % MD;
    }
    if(dp[K-1] < 0) dp[K-1] += MD;
    if(sum[K] < 0) sum[K] += MD;
    writerLn(dp[K-1], sum[K]);
  }

  return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード