Submission #1846220

---

Source Code Expand

#include"bits/stdc++.h"


#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(int x = (l);x<=(u);x++)
#define RREP(x,l,u) for(int x = (l);x>=(u);x--)
#define mst(x,a) memset(x,a,sizeof(x))
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define cl(x) x.clear()

typedef  long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;

const int maxn = 1010;
const int mod = 1e9+7;
const int MAX = 1000000010;
const double eps = 1e-6;
const double PI = acos(-1);

template<typename T> inline void read(T &x){
x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);}
template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);}
template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);}
template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;}
template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;}

int n,m;

ll K;

char st[maxn][maxn];

int A[maxn][maxn];

struct Mat{
	int a[3][3];
}Ans,M;

Mat mul(Mat a,Mat b){
	Mat c;memset(c.a,0,sizeof(c.a));
	REP(i,1,2)REP(j,1,2)REP(k,1,2)c.a[i][j]=(1ll*a.a[i][k]*b.a[k][j]+c.a[i][j])%mod;
	return c;
}

int solve(int r,int c,int t){
	int V=fexp(t,K-1);
	int E=0;
	if(r)REP(i,1,n)REP(j,1,m-1)E+=A[i][j]&A[i][j+1];
	else REP(i,1,n-1)REP(j,1,m)E+=A[i][j]&A[i+1][j];
	Ans.a[1][1]=Ans.a[2][2]=1;
	M.a[1][1]=r+c;M.a[2][1]=E;M.a[2][2]=t;
	K-=2;
	for(;K;K>>=1,M=mul(M,M))if(K&1)Ans=mul(Ans,M);
	E=(1ll*E*Ans.a[1][1]+1ll*t*Ans.a[2][1])%mod;
	return (V-E+mod)%mod;
}

void Work(){
	if(K==1){puts("1");return;}
	int r=0,c=0;
	REP(i,1,n)r+=A[i][1]&&A[i][m];
	REP(i,1,m)c+=A[1][i]&&A[n][i];
	if(r&&c){puts("1");return;}
	int t=0;
	REP(i,1,n)REP(j,1,m)t+=A[i][j];
	if(!r&&!c){printf("%d\n",fexp(t,K-1));return;}
	printf("%d\n",solve(r,c,t));
}

void Init(){
	read(n,m,K);
	REP(i,1,n)scanf("%s",st[i]+1);
	REP(i,1,n)REP(j,1,m)A[i][j]=st[i][j]=='#';
}

int main(){
	Init();
	Work();
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void Init()’:
./Main.cpp:91:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i,1,n)scanf("%s",st[i]+1);
                               ^

Judge Result