Submission #1623698
Source Code Expand
#include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> using namespace std; int h,w; typedef long long LL; LL k; const int MX=1011,md=1000000007; char s[MX][MX]; struct Matrix{ int a[2][2]; Matrix(){memset(a,0,sizeof(a));} Matrix operator *(const Matrix &x)const{ Matrix R; for(int i=0;i<2;i++) for(int j=0;j<2;j++) for(int k=0;k<2;k++) R.a[i][j]=((LL)R.a[i][j]+(LL)a[i][k]*x.a[k][j])%md; return R; } }; inline int pw(int x,int y){ int r=1; while(y){ if(y&1)r=(LL)r*x%md; x=(LL)x*x%md; y>>=1; } return r; } int wk1(){ int C=0; for(int i=0;i<h;i++) for(int j=0;j<w;j++) C+=s[i][j]; return pw(C,(k-1)%(md-1)); } int wk(int lr,int ud){ int C=0; for(int i=0;i<h;i++) for(int j=0;j<w;j++) C+=s[i][j]; int V=pw(C,(k-1)%(md-1)); int E0=0; if(lr){ for(int i=0;i<h;i++) for(int j=0;j<w-1;j++) E0+=(s[i][j]&s[i][j+1]); }else{ for(int i=0;i<h-1;i++) for(int j=0;j<w;j++) E0+=(s[i][j]&s[i+1][j]); } Matrix S,T; S.a[0][0]=E0,S.a[0][1]=C; T.a[0][0]=lr+ud,T.a[1][0]=E0,T.a[1][1]=C; LL t=k-2; while(t){ if(t&1)S=S*T; T=T*T;t>>=1; } return (V-S.a[0][0]+md)%md; } int main(){ scanf("%d%d%lld",&h,&w,&k); for(int i=0;i<h;i++)scanf("%s",s[i]); if(k==1)return puts("1"),0; for(int i=0;i<h;i++)for(int j=0;j<w;j++)s[i][j]=(int)(s[i][j]=='#'); int lr=0,ud=0; for(int i=0;i<w;i++)ud+=(s[0][i]&s[h-1][i]); for(int i=0;i<h;i++)lr+=(s[i][0]&s[i][w-1]); if(lr&&ud)puts("1"); else if(!lr&&!ud)printf("%d\n",wk1()); else printf("%d\n",wk(lr,ud)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Fraction of Fractal |
User | CommonAnts |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 1624 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 1152 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:70:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%lld",&h,&w,&k); ^ ./Main.cpp:71:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=0;i<h;i++)scanf("%s",s[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1700 / 1700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 4 ms | 1152 KB |
02.txt | AC | 5 ms | 1152 KB |
03.txt | AC | 5 ms | 1152 KB |
04.txt | AC | 5 ms | 1152 KB |
05.txt | AC | 5 ms | 1152 KB |
06.txt | AC | 4 ms | 1152 KB |
07.txt | AC | 4 ms | 1152 KB |
08.txt | AC | 4 ms | 1152 KB |
09.txt | AC | 5 ms | 1152 KB |
10.txt | AC | 5 ms | 1152 KB |
11.txt | AC | 4 ms | 1152 KB |
12.txt | AC | 5 ms | 1152 KB |
13.txt | AC | 5 ms | 1152 KB |
14.txt | AC | 4 ms | 1152 KB |
15.txt | AC | 4 ms | 1152 KB |
16.txt | AC | 4 ms | 1152 KB |
17.txt | AC | 5 ms | 1152 KB |
18.txt | AC | 5 ms | 1152 KB |
19.txt | AC | 5 ms | 1152 KB |
20.txt | AC | 5 ms | 1152 KB |
21.txt | AC | 5 ms | 1152 KB |
22.txt | AC | 4 ms | 1152 KB |
23.txt | AC | 5 ms | 1152 KB |
24.txt | AC | 5 ms | 1152 KB |
25.txt | AC | 5 ms | 1152 KB |
26.txt | AC | 5 ms | 1152 KB |
27.txt | AC | 5 ms | 1152 KB |
28.txt | AC | 5 ms | 1152 KB |
29.txt | AC | 0 ms | 128 KB |
30.txt | AC | 0 ms | 128 KB |
31.txt | AC | 1 ms | 128 KB |
32.txt | AC | 0 ms | 128 KB |
33.txt | AC | 0 ms | 128 KB |
34.txt | AC | 1 ms | 128 KB |
35.txt | AC | 0 ms | 128 KB |
36.txt | AC | 0 ms | 128 KB |
37.txt | AC | 0 ms | 128 KB |
38.txt | AC | 0 ms | 128 KB |
39.txt | AC | 0 ms | 128 KB |
40.txt | AC | 0 ms | 128 KB |
41.txt | AC | 0 ms | 128 KB |
42.txt | AC | 0 ms | 128 KB |
43.txt | AC | 0 ms | 128 KB |
44.txt | AC | 0 ms | 128 KB |
s1.txt | AC | 0 ms | 128 KB |
s2.txt | AC | 0 ms | 128 KB |
s3.txt | AC | 0 ms | 128 KB |