Submission #1838802


Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <assert.h>

using namespace std;

typedef long long ll;

const int N=1010,P=1e9+7;

struct mat{
  int a[2][2];
  mat(){ a[0][0]=a[1][1]=a[0][1]=a[1][0]=0; }
  int *operator [](int x){
    return a[x];
  }
  friend mat operator *(mat a,mat b){
    mat c;
    c[0][0]=(1LL*a[0][0]*b[0][0]+1LL*a[0][1]*b[1][0])%P;
    c[0][1]=(1LL*a[0][0]*b[0][1]+1LL*a[0][1]*b[1][1])%P;
    c[1][0]=(1LL*a[1][0]*b[0][0]+1LL*a[1][1]*b[1][0])%P;
    c[1][1]=(1LL*a[1][0]*b[0][1]+1LL*a[1][1]*b[1][1])%P;
    return c;
  }
};

mat u;
int n,m;
char a[N][N],b[N][N];
ll k;

inline int judge(){
  for(int i=1;i<=n;i++)
    if(a[i][1]=='#' && a[i][m]=='#') return 1;
  return 0;
}

inline void turn(){
  for(int i=1;i<=n;i++)
    for(int j=1;j<=m;j++)
      b[m-j+1][i]=a[i][j];
  swap(n,m); memcpy(a,b,sizeof(a));
}

inline int Pow(int x,ll y){
  int ret=1;
  for(;y;y>>=1,x=1LL*x*x%P) if(y&1) ret=1LL*ret*x%P;
  return ret;
}

inline mat Pow(mat x,ll y){
  mat ret=u;
  for(;y;y>>=1,x=x*x) if(y&1) ret=ret*x;
  return ret;
}

int main(){
  u[0][0]=u[1][1]=1;
  scanf("%d%d%lld",&n,&m,&k);
  int cnt=0;
  for(int i=1;i<=n;i++){
    scanf("%s",a[i]+1);
    for(int j=1;j<=m;j++)
      cnt+=a[i][j]=='#';
  }
  int A=judge(),B=(turn(),judge()); turn();
  if((A && B) || !k) return puts("1"),0;
  if(!A && !B) return printf("%d\n",Pow(cnt,k-1)),0;
  if(!A) turn();
  int c=0,b=0; for(int i=1;i<=n;i++) c+=(a[i][1]=='#' && a[i][m]=='#');
  for(int i=1;i<=n;i++)
    for(int j=1;j<m;j++)
      b+=(a[i][j]=='#' && a[i][j+1]=='#');
  mat w,ans; w[0][0]=cnt; w[0][1]=b; w[1][1]=c;
  ans=Pow(w,k-1);
  printf("%d\n",(ans[0][0]+P-ans[0][1])%P);
  return 0;
}

Submission Info

Submission Time
Task F - Fraction of Fractal
User SBP
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1791 Byte
Status AC
Exec Time 13 ms
Memory 2176 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:61:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%lld",&n,&m,&k);
                             ^
./Main.cpp:64:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",a[i]+1);
                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1700 / 1700
Status
AC × 3
AC × 47
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 10 ms 2176 KB
02.txt AC 11 ms 2176 KB
03.txt AC 13 ms 2176 KB
04.txt AC 11 ms 2176 KB
05.txt AC 13 ms 2176 KB
06.txt AC 10 ms 2176 KB
07.txt AC 9 ms 2176 KB
08.txt AC 10 ms 2176 KB
09.txt AC 11 ms 2176 KB
10.txt AC 13 ms 2176 KB
11.txt AC 10 ms 2176 KB
12.txt AC 10 ms 2176 KB
13.txt AC 10 ms 2176 KB
14.txt AC 10 ms 2176 KB
15.txt AC 10 ms 2176 KB
16.txt AC 9 ms 2176 KB
17.txt AC 10 ms 2176 KB
18.txt AC 11 ms 2176 KB
19.txt AC 11 ms 2176 KB
20.txt AC 13 ms 2176 KB
21.txt AC 13 ms 2176 KB
22.txt AC 10 ms 2176 KB
23.txt AC 12 ms 2176 KB
24.txt AC 12 ms 2176 KB
25.txt AC 12 ms 2176 KB
26.txt AC 10 ms 2176 KB
27.txt AC 12 ms 2176 KB
28.txt AC 10 ms 2176 KB
29.txt AC 2 ms 1280 KB
30.txt AC 2 ms 1280 KB
31.txt AC 2 ms 1280 KB
32.txt AC 2 ms 1280 KB
33.txt AC 2 ms 1280 KB
34.txt AC 2 ms 1280 KB
35.txt AC 2 ms 1280 KB
36.txt AC 2 ms 1280 KB
37.txt AC 2 ms 1280 KB
38.txt AC 2 ms 1280 KB
39.txt AC 2 ms 1280 KB
40.txt AC 2 ms 1280 KB
41.txt AC 2 ms 1280 KB
42.txt AC 2 ms 1280 KB
43.txt AC 2 ms 1280 KB
44.txt AC 2 ms 1280 KB
s1.txt AC 2 ms 1280 KB
s2.txt AC 2 ms 1280 KB
s3.txt AC 2 ms 1280 KB