Submission #1136839
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> #include <vector> #include <algorithm> #include <cmath> using namespace std; #define mp make_pair #define pb push_back #define ll long long #define maxN 1024 #define mod 1000000007 ll aux[2][2]; struct matrix { ll data[2][2]; int i, j, k; void operator*=(matrix who) { memcpy(aux, data, sizeof(data)); for (i = 0; i < 2; i++) { for (j = 0; j < 2; j++) { data[i][j] = 0; for (k = 0; k < 2; k++) data[i][j] += (aux[i][k] * who.data[k][j]) % mod; data[i][j] %= mod; } } } }; int n, m, i, j; ll k, cnt; char s[maxN][maxN]; int hor, ver, link_hor, link_ver; ll a, b, c; matrix ini; ll poww(ll a, ll b) { ll ans = 1; while (b > 0) { if (b & 1) ans = (ans * a) % mod; b >>= 1; a = (a * a) % mod; } return ans; } matrix poww(matrix a, ll b) { matrix ans = a; b--; while (b > 0) { if (b & 1) ans *= a; b >>= 1; a *= a; } return ans; } int main() { // freopen("test.in","r",stdin); scanf("%d%d%lld\n", &n, &m, &k); for (i = 1; i <= n; i++) scanf("%s", s[i] + 1); for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (s[i][j] != '#') continue; cnt++; if (s[i + 1][j] == '#') ver++; if (s[i][j + 1] == '#') hor++; } } for (i = 1; i <= n; i++) if (s[i][1] == s[i][m] && s[i][1] == '#') link_hor++; for (i = 1; i <= m; i++) if (s[1][i] == s[n][i] && s[1][i] == '#') link_ver++; if (k == 0) { printf("1"); } if (link_hor > 0 && link_ver > 0) { printf("1"); return 0; } if (link_hor == 0 && link_ver == 0) { printf("%lld", poww(cnt, k - 1)); return 0; } if (k == 1) { printf("1"); return 0; } a = cnt; if (link_hor) { b = hor; c = link_hor; } else { b = ver; c = link_ver; } ini.data[0][0] = a; ini.data[0][1] = -b; ini.data[1][0] = 0; ini.data[1][1] = c; ini = poww(ini, k - 1); ll sol = (mod + ini.data[0][0] + ini.data[0][1]); printf("%lld", sol % mod); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Fraction of Fractal |
User | atatomir |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 2484 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 1280 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:75:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%lld\n", &n, &m, &k); ^ ./Main.cpp:76:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (i = 1; i <= n; i++) 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 | 6 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 | 6 ms | 1280 KB |
07.txt | AC | 6 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 | 5 ms | 1280 KB |
13.txt | AC | 5 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 | 5 ms | 1280 KB |
27.txt | AC | 5 ms | 1280 KB |
28.txt | AC | 5 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 |