Submission #1687631
Source Code Expand
//2017-10-15
//miaomiao
//
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define Set(a, v) memset(a, v, sizeof(a))
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define N (1000+5)
const int P = 1e9 + 7;
int Pow(LL a, LL anum){
a %= P;
int ret = 1;
while(anum){
if(anum & 1) ret = 1ll * ret * a % P;
a = 1ll * a * a % P; anum >>= 1;
}
return ret;
}
char mp[N][N];
struct Matrix{
int h[2][2];
Matrix(int op = 0){
Set(h, 0);
if(op) h[0][0] = h[1][1] = 1;
}
Matrix operator *(const Matrix &rhs)const{
Matrix ret;
For(i, 0, 1) For(j, 0, 1) For(k, 0, 1)
(ret.h[i][k] += 1ll * h[i][j] * rhs.h[j][k] % P) %= P;
return ret;
}
Matrix operator ^(LL knum){
Matrix ret(1), a = *this;
while(knum){
if(knum & 1) ret = ret * a;
a = a * a; knum >>= 1;
}
// printf("%d %d\n%d %d\n", ret.h[0][0], ret.h[0][1], ret.h[1][0], ret.h[1][1]);
return ret;
}
}a, tmp;
int main(){
int n, m;
LL rk;
scanf("%d%d%lld", &n, &m, &rk);
For(i, 1, n) scanf("%s", mp[i]+1);
int ncnt = 0, mcnt = 0, cnt = 0;
For(i, 1, n) For(j, 1, m) cnt += mp[i][j] == '#';
For(i, 1, n) ncnt += (mp[i][1]=='#' && mp[i][m]=='#');
For(i, 1, m) mcnt += (mp[1][i]=='#' && mp[n][i]=='#');
if(ncnt && mcnt) puts("1");
else if(!ncnt && !mcnt) printf("%d\n", Pow(cnt, rk-1));
else{
int rnum = 0;
if(ncnt){
For(i, 1, n) For(j, 1, m-1)
if(mp[i][j]=='#' && mp[i][j+1]=='#') --rnum;
}else{
For(i, 1, m) For(j, 1, n-1)
if(mp[j][i]=='#' && mp[j+1][i]=='#') --rnum;
}
// printf("cnt = %d rnum = %d ncnt = %d mcnt = %d\n", cnt, rnum, ncnt, mcnt);
a.h[0][0] = cnt; a.h[0][1] = rnum; a.h[1][1] = max(ncnt, mcnt);
tmp.h[0][0] = tmp.h[1][0] = 1;
printf("%d\n", (((a^(rk-1)) * tmp).h[0][0]+P) % P);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
F - Fraction of Fractal |
User |
miaomiao |
Language |
C++14 (GCC 5.4.1) |
Score |
1700 |
Code Size |
1961 Byte |
Status |
AC |
Exec Time |
7 ms |
Memory |
1280 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:66:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%lld", &n, &m, &rk);
^
./Main.cpp:67:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
For(i, 1, n) scanf("%s", mp[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 |
5 ms |
1280 KB |
02.txt |
AC |
6 ms |
1280 KB |
03.txt |
AC |
7 ms |
1280 KB |
04.txt |
AC |
6 ms |
1280 KB |
05.txt |
AC |
7 ms |
1280 KB |
06.txt |
AC |
5 ms |
1280 KB |
07.txt |
AC |
5 ms |
1280 KB |
08.txt |
AC |
5 ms |
1280 KB |
09.txt |
AC |
6 ms |
1280 KB |
10.txt |
AC |
7 ms |
1280 KB |
11.txt |
AC |
5 ms |
1280 KB |
12.txt |
AC |
6 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 |
6 ms |
1280 KB |
19.txt |
AC |
6 ms |
1280 KB |
20.txt |
AC |
7 ms |
1280 KB |
21.txt |
AC |
7 ms |
1280 KB |
22.txt |
AC |
5 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 |