Submission #3456928
Source Code Expand
#include<bits/stdc++.h> #define LL long long using namespace std; const int N = 1005; const int mod = 1e9 + 7; int n, m; LL k; char s[N][N]; struct Matrix { LL a[2][2]; }; Matrix operator * (Matrix x, Matrix y) { Matrix ans; for (int i = 0; i < 2; ++i) { for (int j = 0; j < 2; ++j) { LL res = 0; for (int k = 0; k < 2; ++k) { res = (res + x.a[i][k] * y.a[k][j]) % mod; } ans.a[i][j] =res; } } return ans; } LL Qpow(LL x, LL p) { LL ans = 1; while (p) { if (p & 1) ans = ans * x % mod; x = x * x % mod; p >>= 1; } return ans; } int main() { cin >> n >> m >> k; for (int i = 1; i <= n; ++i) scanf("%s", s[i] + 1); if (k <= 1) return 0 * puts("1"); LL f = 0, c = 0, c1 = 0, c2 = 0, d = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (s[i][j] == '#') ++c; } } for (int i = 1; i <= n; ++i) { if (s[i][1] == s[i][m] && s[i][1] == '#') f |= 1, ++c1; } for (int i = 1; i <= m; ++i) { if (s[1][i] == s[n][i] && s[1][i] == '#') f |= 2, ++c2; } if (f == 3) return 0 * puts("1"); if (f == 0) return 0 * printf("%lld\n", Qpow(c, k - 1)); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (f == 1 && j < m && s[i][j] == '#' && s[i][j + 1] == '#') ++d; if (f == 2 && i < n && s[i][j] == '#' && s[i + 1][j] == '#') ++d; } } // cout << c << ' ' << d << endl; Matrix res = (Matrix) {1, 0, 0, 1}; Matrix x = (Matrix) {c , 0, -1, (f == 1) ? c1 : c2}; k--; while (k) { if (k & 1) res = res * x; x = x * x ; k >>= 1; } /* for (int i = 0; i < 2; ++i) { for (int j = 0; j < 2; ++j) cout << res.a[i][j] << ' '; puts(""); }*/ LL ans = res.a[0][0] + d * res.a[1][0]; ans = (ans % mod + mod) % mod; cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | F - Fraction of Fractal |
User | Vexoben |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 1812 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 1280 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:42:24: 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 | 7 ms | 1280 KB |
03.txt | AC | 7 ms | 1280 KB |
04.txt | AC | 7 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 | 7 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 | 4 ms | 1280 KB |
15.txt | AC | 4 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 | 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 |