Submission #1677754
Source Code Expand
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
typedef long long ll;
const ll maxn=1e3+10,mod=1e9+7;
ll n,m,k;
char s[maxn][maxn];
struct matrix{
ll x[4][4],lenx,leny;
matrix(ll a,ll b){
memset(x,0,sizeof(x));
lenx=a;leny=b;
}
inline void e(){
for(ll i=0;i<lenx;++i)
x[i][i]=1;
}
matrix operator* (matrix o){
matrix res(lenx,o.leny);
for(ll i=0;i<lenx;++i)
for(ll j=0;j<o.leny;++j)
for(ll k=0;k<leny;++k)
(res.x[i][j]+=x[i][k]*o.x[k][j])%=mod;
return res;
}
};
inline matrix qpow(matrix a,ll n){
matrix res(a.lenx,a.leny);res.e();
while(n){
if(n&1ll)
res=res*a;
a=a*a;
n>>=1;
}
return res;
}
inline ll qpow(ll a,ll n){
ll res=1;
while(n){
if(n&1ll)
res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
inline void judge(){
if(!k){
puts("1");
exit(0);
}
bool flag1=false,flag2=false;
for(ll i=0;i<m;++i)
if(s[0][i]=='#'&&s[n-1][i]=='#')
flag1=true;
for(ll i=0;i<n;++i)
if(s[i][0]=='#'&&s[i][m-1]=='#')
flag2=true;
if(flag1&&flag2){
puts("1");
exit(0);
}
if(!flag1&&!flag2){
ll cnt=0;
for(ll i=0;i<n;++i)
for(ll j=0;j<m;++j)
if(s[i][j]=='#')
++cnt;
printf("%lld\n",qpow(cnt,k-1));
exit(0);
}
if(flag1){
for(ll i=0;i<n;++i)
for(ll j=0;j<m;++j)
if(i>=m||j>=n)
s[j][i]=s[i][j];
else if(i<j)
swap(s[i][j],s[j][i]);
swap(n,m);
}
}
int main(){
scanf("%lld%lld%lld",&n,&m,&k);
for(ll i=0;i<n;++i)
scanf("%s",s[i]);
judge();
matrix res(1,4),base(4,4);
for(ll i=0;i<n;++i){
if(s[i][0]=='#')
if(s[i][m-1]=='#')
if(s[i][1]=='#')
++base.x[0][1],++base.x[1][1],++base.x[2][3],++base.x[3][3];
else
++base.x[0][0],++base.x[1][0],++base.x[2][2],++base.x[3][2];
else
if(s[i][1]=='#')
++base.x[0][1],++base.x[1][1],++base.x[2][1],++base.x[3][1];
else
++base.x[0][0],++base.x[1][0],++base.x[2][0],++base.x[3][0];
for(ll j=1;j<m-1;++j)
if(s[i][j]=='#')
if(s[i][j-1]=='#')
if(s[i][j+1]=='#')
++base.x[0][3],++base.x[1][3],++base.x[2][3],++base.x[3][3];
else
++base.x[0][2],++base.x[1][2],++base.x[2][2],++base.x[3][2];
else
if(s[i][j+1]=='#')
++base.x[0][1],++base.x[1][1],++base.x[2][1],++base.x[3][1];
else
++base.x[0][0],++base.x[1][0],++base.x[2][0],++base.x[3][0];
if(m>1&&s[i][m-1]=='#')
if(s[i][m-2]=='#')
if(s[i][0]=='#')
++base.x[0][2],++base.x[1][3],++base.x[2][2],++base.x[3][3];
else
++base.x[0][2],++base.x[1][2],++base.x[2][2],++base.x[3][2];
else
if(s[i][0]=='#')
++base.x[0][0],++base.x[1][1],++base.x[2][0],++base.x[3][1];
else
++base.x[0][0],++base.x[1][0],++base.x[2][0],++base.x[3][0];
}
res.x[0][0]=1;
res=res*qpow(base,k-1);
printf("%lld\n",(res.x[0][0]+res.x[0][2])%mod);
return 0;
}
Submission Info
Submission Time
2017-10-12 15:55:20+0900
Task
F - Fraction of Fractal
User
guo
Language
C++14 (GCC 5.4.1)
Score
1700
Code Size
2972 Byte
Status
AC
Exec Time
9 ms
Memory
1280 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:89:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld%lld",&n,&m,&k);
^
./Main.cpp:91:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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
1280 KB
02.txt
AC
7 ms
1280 KB
03.txt
AC
8 ms
1280 KB
04.txt
AC
7 ms
1280 KB
05.txt
AC
9 ms
1280 KB
06.txt
AC
5 ms
1280 KB
07.txt
AC
5 ms
1280 KB
08.txt
AC
4 ms
1280 KB
09.txt
AC
7 ms
1280 KB
10.txt
AC
9 ms
1280 KB
11.txt
AC
4 ms
1280 KB
12.txt
AC
5 ms
1280 KB
13.txt
AC
6 ms
1280 KB
14.txt
AC
5 ms
1280 KB
15.txt
AC
5 ms
1280 KB
16.txt
AC
5 ms
1280 KB
17.txt
AC
6 ms
1280 KB
18.txt
AC
7 ms
1280 KB
19.txt
AC
7 ms
1280 KB
20.txt
AC
9 ms
1280 KB
21.txt
AC
9 ms
1280 KB
22.txt
AC
5 ms
1280 KB
23.txt
AC
7 ms
1280 KB
24.txt
AC
6 ms
1280 KB
25.txt
AC
6 ms
1280 KB
26.txt
AC
5 ms
1280 KB
27.txt
AC
6 ms
1280 KB
28.txt
AC
5 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