Submission #1794746
Source Code Expand
// This amazing code is by Eric Sunli Chen. #include <algorithm> #include <bitset> #include <cmath> #include <cstring> #include <cstdio> #include <cstdlib> #include <ctime> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <string> #include <utility> #include <vector> using namespace std; template<typename T> bool get_int(T &x) { char t=getchar(); bool neg=false; x=0; for(; (t>'9'||t<'0')&&t!='-'&&t!=EOF; t=getchar()); if(t=='-')neg=true,t=getchar();if(t==EOF)return false; for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0'; if(neg)x=-x;return true; } template<typename T> void print_int(T x) { if(x<0)putchar('-'),x=-x; short a[20]= {},sz=0; while(x>0)a[sz++]=x%10,x/=10; if(sz==0)putchar('0'); for(int i=sz-1; i>=0; i--)putchar('0'+a[i]); } #define ff first #define ss second #define pb push_back #define mp make_pair #define get1(a) get_int(a) #define get2(a,b) (get1(a)&&get1(b)) #define get3(a,b,c) (get1(a)&&get2(b,c)) #define printendl(a) print_int(a),puts("") typedef long long LL; typedef unsigned long long uLL; typedef pair<int,int> pii; const int inf=0x3f3f3f3f; const LL Linf=1ll<<61; const double pi=acos(-1.0); const int mod=1e9+7; struct matrix { int a[2][2]; void clear(int x=0){a[0][1]=a[1][0]=0;a[0][0]=a[1][1]=x;} matrix(int x=0){clear(x);} void out(){printf("%d %d\n%d %d\n",a[0][0],a[0][1],a[1][0],a[1][1]);} }; matrix operator *(const matrix&a,const matrix&b) { matrix ret(0); for(int i=0;i<2;i++)for(int j=0;j<2;j++)for(int k=0;k<2;k++) ret.a[i][j]=(ret.a[i][j]+1ll*a.a[i][k]*b.a[k][j])%mod; return ret; } int power(int x,LL y){int ret=1;do{if(y&1)ret=1ll*ret*x%mod;x=1ll*x*x%mod;}while(y>>=1);return ret;} matrix power(matrix x,LL y){matrix ret(1);do{if(y&1)ret=ret*x;x=x*x;}while(y>>=1);return ret;} int n,m; LL k; char s[1111][1111]; int main() { get3(n,m,k); if(k==0) { puts("1"); return 0; } for(int i=1;i<=n;i++) scanf("%s",s[i]+1); int cn=0,cm=0,all=0; for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)all+=(s[i][j]=='#'); for(int i=1;i<=n;i++)cn+=(s[i][1]=='#'&&s[i][m]=='#'); for(int j=1;j<=m;j++)cm+=(s[1][j]=='#'&&s[n][j]=='#'); if(cn&&cm)puts("1"); else if(!cn&&!cm) printf("%d\n",power(all,k-1)); else { matrix tran;tran.a[0][0]=all; int c2=0; if(cn) { tran.a[1][1]=cn; for(int i=1;i<=n;i++)for(int j=1;j<m;j++) c2+=(s[i][j]=='#'&&s[i][j+1]=='#'); } else { for(int i=1;i<n;i++)for(int j=1;j<=m;j++) c2+=(s[i][j]=='#'&&s[i+1][j]=='#'); tran.a[1][1]=cm; } tran.a[0][1]=mod-c2; tran=power(tran,k-1); printf("%d\n",(tran.a[0][0]+tran.a[0][1])%mod); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Fraction of Fractal |
User | OhWeOnFire |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 2729 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 1280 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:80:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] 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 | 5 ms | 1280 KB |
02.txt | AC | 6 ms | 1280 KB |
03.txt | AC | 6 ms | 1280 KB |
04.txt | AC | 6 ms | 1280 KB |
05.txt | AC | 6 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 | 6 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 | 6 ms | 1280 KB |
21.txt | AC | 6 ms | 1280 KB |
22.txt | AC | 5 ms | 1280 KB |
23.txt | AC | 5 ms | 1280 KB |
24.txt | AC | 5 ms | 1280 KB |
25.txt | AC | 5 ms | 1280 KB |
26.txt | AC | 6 ms | 1280 KB |
27.txt | AC | 5 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 |