Contest Duration: - (local time) (110 minutes) Back to Home

Submission #847881

Source Code Expand

Copy
```#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define forn(i, a, n) for (int i = a; i < n; ++i)
#define ford(i, a, n) for (int i = n - 1; i >= a; --i)
#define fore(i, a, n) for (int i = a; i <= n; ++i)
#define all(a) (a).begin(), (a).end()
#define fs first
#define sn second
#define trace(a)\
for (auto i : a) cerr << i << ' ';\
cerr << '\n'
#define eb emplace_back

#ifndef M_PI
const ld M_PI = acos(-1.0);
#endif

const ld eps = 1e-9;
const int INF = 2000000000;
const ll LINF = 1ll * INF * INF;
const ll MOD = 1000000007;

struct Matrix {
ll a[2][2];

Matrix () {};

Matrix (int cells, int inBound, int outBound) {
a[0][0] = cells;
a[0][1] = -inBound;
if (a[0][1] < 0) a[0][1] += MOD;
a[1][0] = 0;
a[1][1] = outBound;
}

Matrix operator* (Matrix other) {
Matrix m(0, 0, 0);
forn(i, 0, 2) forn(j, 0, 2) forn(k, 0, 2) {
m.a[i][k] += a[i][j] * other.a[j][k];
m.a[i][k] %= MOD;
}
return m;
}

Matrix Pow (ll k) {
Matrix x = *this, y = Matrix(1, 0, 1);
while (k) {
if (k % 2) y = x * y;
x = x * x;
k /= 2;
}
return y;
}
};

ll Pow (ll n, ll k) {
ll x = n, y = 1;
while (k) {
if (k % 2) y = y * x % MOD;
x = x * x % MOD;
k /= 2;
}
return y;
}

const int N = 1002;
char a[N][N];

int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
ll k;
cin >> h >> w >> k;
if (k <= 1) {
cout << "1\n";
return 0;
}
forn(i, 0, h) forn(j, 0, w) cin >> a[i][j];
bool ver = false, hor = false;
forn(i, 0, h) if (a[i][0] == '#' && a[i][w - 1] == '#') hor = true;
forn(i, 0, w) if (a[0][i] == '#' && a[h - 1][i] == '#') ver = true;
if (hor && ver) {
cout << "1\n";
return 0;
}
int sz = 0;
forn(i, 0, h) forn(j, 0, w) if (a[i][j] == '#') ++sz;
if (!hor && !ver) {
cout << Pow(sz, k - 1) << '\n';
return 0;
}
if (ver) {
forn(i, 0, N) forn(j, 0, i) swap(a[i][j], a[j][i]);
swap(h, w);
}
int in = 0;
forn(i, 0, h) forn(j, 0, w - 1) if (a[i][j] == '#' && a[i][j + 1] == '#') ++in;
int out = 0;
forn(i, 0, h) if (a[i][0] == '#' && a[i][w - 1] == '#') ++out;
Matrix M = Matrix(sz, in, out);
Matrix P = M.Pow(k - 1);
cout << (P.a[0][0] + P.a[0][1]) % MOD << '\n';
return 0;
}
```

#### Submission Info

Submission Time 2016-08-21 22:29:38+0900 F - Fraction of Fractal khadaev C++14 (GCC 5.4.1) 1700 2348 Byte AC 32 ms 1280 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1700 / 1700
Status
 AC × 3
 AC × 47
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 22 ms 1280 KB
02.txt AC 26 ms 1280 KB
03.txt AC 28 ms 1280 KB
04.txt AC 25 ms 1280 KB
05.txt AC 27 ms 1280 KB
06.txt AC 23 ms 1280 KB
07.txt AC 23 ms 1280 KB
08.txt AC 22 ms 1280 KB
09.txt AC 25 ms 1280 KB
10.txt AC 27 ms 1280 KB
11.txt AC 22 ms 1280 KB
12.txt AC 25 ms 1280 KB
13.txt AC 25 ms 1280 KB
14.txt AC 25 ms 1280 KB
15.txt AC 24 ms 1280 KB
16.txt AC 24 ms 1280 KB
17.txt AC 26 ms 1280 KB
18.txt AC 26 ms 1280 KB
19.txt AC 25 ms 1280 KB
20.txt AC 27 ms 1280 KB
21.txt AC 27 ms 1280 KB
22.txt AC 24 ms 1280 KB
23.txt AC 27 ms 1280 KB
24.txt AC 26 ms 1280 KB
25.txt AC 26 ms 1280 KB
26.txt AC 25 ms 1280 KB
27.txt AC 26 ms 1280 KB
28.txt AC 32 ms 1280 KB
29.txt AC 4 ms 256 KB
30.txt AC 4 ms 256 KB
31.txt AC 4 ms 256 KB
32.txt AC 4 ms 256 KB
33.txt AC 4 ms 256 KB
34.txt AC 4 ms 256 KB
35.txt AC 4 ms 256 KB
36.txt AC 4 ms 256 KB
37.txt AC 4 ms 256 KB
38.txt AC 4 ms 256 KB
39.txt AC 4 ms 256 KB
40.txt AC 4 ms 256 KB
41.txt AC 4 ms 256 KB
42.txt AC 4 ms 256 KB
43.txt AC 4 ms 256 KB
44.txt AC 4 ms 256 KB
s1.txt AC 4 ms 256 KB
s2.txt AC 4 ms 256 KB
s3.txt AC 4 ms 256 KB