Submission #1773977
Source Code Expand
#include <algorithm> #include <iostream> #include <cstring> #include <cstdio> #include <cmath> using namespace std; typedef long long s64; const int MaxN = 1000; const int M = 1000000007; int n, m; s64 k; char s[MaxN + 1][MaxN + 2]; struct matrix { int a[2][2]; inline void construct(int v1, int v2, int v3, int v4) { a[0][0] = v1, a[0][1] = v2; a[1][0] = v3, a[1][1] = v4; } friend inline matrix operator*(const matrix &lhs, const matrix &rhs) { matrix res; for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) res.a[i][j] = ((s64)lhs.a[i][0] * rhs.a[0][j] + (s64)lhs.a[i][1] * rhs.a[1][j]) % M; return res; } }; matrix tr; int main() { cin >> n >> m >> k; for (int i = 1; i <= n; ++i) scanf("%s", s[i] + 1); int cx = 0, lx = 0; for (int i = 1; i <= n; ++i) { cx += s[i][1] == '#' && s[i][n] == '#'; for (int j = 1; j < m; ++j) lx += s[i][j] == '#' && s[i][j + 1] == '#'; } int cy = 0, ly = 0; for (int j = 1; j <= m; ++j) { cy += s[1][j] == '#' && s[n][j] == '#'; for (int i = 1; i < n; ++i) ly += s[i][j] == '#' && s[i + 1][j] == '#'; } int num = 0; for (int i = 1; i <= n; ++i) num += count(s[i] + 1, s[i] + m + 1, '#'); if (k <= 1 || (cx && cy)) { puts("1"); return 0; } if (cx > 0) tr.construct(num, 0, M - lx, cx); else if (cy > 0) tr.construct(num, 0, M - ly, cy); else tr.construct(num, 0, 0, 0); matrix res = tr; for (s64 i = k - 2; i; i >>= 1) { if (i & 1) res = res * tr; tr = tr * tr; } cout << (res.a[0][0] + res.a[1][0]) % M; cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Fraction of Fractal |
User | InvUsr |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1656 Byte |
Status | WA |
Exec Time | 8 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 | 0 / 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 | 8 ms | 1280 KB |
02.txt | AC | 8 ms | 1280 KB |
03.txt | AC | 8 ms | 1280 KB |
04.txt | AC | 8 ms | 1280 KB |
05.txt | WA | 8 ms | 1280 KB |
06.txt | AC | 8 ms | 1280 KB |
07.txt | AC | 8 ms | 1280 KB |
08.txt | AC | 7 ms | 1280 KB |
09.txt | WA | 8 ms | 1280 KB |
10.txt | AC | 8 ms | 1280 KB |
11.txt | WA | 7 ms | 1280 KB |
12.txt | AC | 7 ms | 1280 KB |
13.txt | AC | 8 ms | 1280 KB |
14.txt | AC | 7 ms | 1280 KB |
15.txt | AC | 7 ms | 1280 KB |
16.txt | AC | 7 ms | 1280 KB |
17.txt | AC | 7 ms | 1280 KB |
18.txt | WA | 8 ms | 1280 KB |
19.txt | WA | 8 ms | 1280 KB |
20.txt | WA | 8 ms | 1280 KB |
21.txt | AC | 8 ms | 1280 KB |
22.txt | AC | 7 ms | 1280 KB |
23.txt | AC | 7 ms | 1280 KB |
24.txt | AC | 7 ms | 1280 KB |
25.txt | AC | 7 ms | 1280 KB |
26.txt | AC | 7 ms | 1280 KB |
27.txt | AC | 7 ms | 1280 KB |
28.txt | AC | 7 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 | WA | 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 |