Submission #9422756
Source Code Expand
// =================================== // author: M_sea // website: http://m-sea-blog.com/ // =================================== #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <cstdio> #include <vector> #include <cmath> #define re register using namespace std; typedef long long ll; inline ll read() { ll X=0,w=1; char c=getchar(); while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); } while (c>='0'&&c<='9') X=X*10+c-'0',c=getchar(); return X*w; } const int N=1000+10; const int mod=1e9+7; inline int qpow(int a,ll b) { int c=1; for (;b;b>>=1,a=1ll*a*a%mod) if (b&1) c=1ll*c*a%mod; return c; } int n,m; ll k; char s[N][N]; struct Matrix { int s[2][2]; Matrix() { s[0][0]=s[0][1]=s[1][0]=s[1][1]=0; } int* operator [](int i) { return s[i]; } } M; Matrix operator *(Matrix a,Matrix b) { Matrix c; for (re int i=0;i<2;++i) for (re int k=0;k<2;++k) for (re int j=0;j<2;++j) c[i][j]=(c[i][j]+1ll*a[i][k]*b[k][j])%mod; return c; } inline Matrix qpow(Matrix a,ll b) { Matrix c; c[0][0]=c[1][1]=1; for (;b;b>>=1,a=a*a) if (b&1) c=c*a; return c; } int main() { n=read(),m=read(),k=read(); for (re int i=1;i<=n;++i) scanf("%s",s[i]+1); int ud=0,lr=0,c=0,ud_=0,lr_=0; for (re int i=1;i<=m;++i) if (s[1][i]=='#'&&s[n][i]=='#') ++ud; for (re int i=1;i<=n;++i) if (s[i][1]=='#'&&s[i][m]=='#') ++lr; for (re int i=1;i<=n;++i) for (re int j=1;j<=m;++j) if (s[i][j]=='#') ++c; for (re int i=1;i<n;++i) for (re int j=1;j<=m;++j) if (s[i][j]=='#'&&s[i+1][j]=='#') ++ud_; for (re int i=1;i<=n;++i) for (re int j=1;j<m;++j) if (s[i][j]=='#'&&s[i][j+1]=='#') ++lr_; if (ud&&lr) puts("1"); else if (!ud&&!lr) printf("%d\n",qpow(c,k-1)); else if (ud) { M[0][0]=c,M[0][1]=ud_,M[1][0]=0,M[1][1]=ud; M=qpow(M,k-1); printf("%d\n",(M[0][0]-M[0][1]+mod)%mod); } else { M[0][0]=c,M[0][1]=lr_,M[1][0]=0,M[1][1]=lr; M=qpow(M,k-1); printf("%d\n",(M[0][0]-M[0][1]+mod)%mod); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Fraction of Fractal |
User | M_sea |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 2176 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 1280 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:52:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (re int i=1;i<=n;++i) scanf("%s",s[i]+1); ^
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 | 7 ms | 1280 KB |
02.txt | AC | 7 ms | 1280 KB |
03.txt | AC | 7 ms | 1280 KB |
04.txt | AC | 7 ms | 1280 KB |
05.txt | AC | 7 ms | 1280 KB |
06.txt | AC | 7 ms | 1280 KB |
07.txt | AC | 7 ms | 1280 KB |
08.txt | AC | 6 ms | 1280 KB |
09.txt | AC | 7 ms | 1280 KB |
10.txt | AC | 7 ms | 1280 KB |
11.txt | AC | 6 ms | 1280 KB |
12.txt | AC | 6 ms | 1280 KB |
13.txt | AC | 7 ms | 1280 KB |
14.txt | AC | 6 ms | 1280 KB |
15.txt | AC | 6 ms | 1280 KB |
16.txt | AC | 6 ms | 1280 KB |
17.txt | AC | 7 ms | 1280 KB |
18.txt | AC | 7 ms | 1280 KB |
19.txt | AC | 7 ms | 1280 KB |
20.txt | AC | 7 ms | 1280 KB |
21.txt | AC | 7 ms | 1280 KB |
22.txt | AC | 6 ms | 1280 KB |
23.txt | AC | 6 ms | 1280 KB |
24.txt | AC | 6 ms | 1280 KB |
25.txt | AC | 6 ms | 1280 KB |
26.txt | AC | 6 ms | 1280 KB |
27.txt | AC | 6 ms | 1280 KB |
28.txt | AC | 6 ms | 1280 KB |
29.txt | AC | 1 ms | 256 KB |
30.txt | AC | 1 ms | 256 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 1 ms | 256 KB |
33.txt | AC | 1 ms | 256 KB |
34.txt | AC | 1 ms | 256 KB |
35.txt | AC | 1 ms | 256 KB |
36.txt | AC | 1 ms | 256 KB |
37.txt | AC | 1 ms | 256 KB |
38.txt | AC | 1 ms | 256 KB |
39.txt | AC | 1 ms | 256 KB |
40.txt | AC | 1 ms | 256 KB |
41.txt | AC | 1 ms | 256 KB |
42.txt | AC | 1 ms | 256 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |