Submission #847602
Source Code Expand
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <deque>
#include <queue>
#include <cstring>
#include <set>
#include <list>
#include <map>
#include <random>
#include <unordered_map>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef std::vector<int> vi;
typedef std::vector<bool> vb;
typedef std::vector<string> vs;
typedef std::vector<double> vd;
typedef std::vector<long long> vll;
typedef std::vector<std::vector<int> > vvi;
typedef vector<vvi> vvvi;
typedef vector<vll> vvll;
typedef std::vector<std::pair<int, int> > vpi;
typedef vector<vpi> vvpi;
typedef std::pair<int, int> pi;
typedef std::pair<ll, ll> pll;
typedef std::vector<pll> vpll;
const long long mod = 1000000007;
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define forn(i, a, b) for(int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
char a[1000][1011];
ll powM(ll k, ll n, ll modulo) {
if (n==0) return 1;
if(n==1) return k;
ll x = powM(k, n/2, modulo);
return (((x*x)%modulo)*powM(k, n%2, modulo)) % modulo;
}
vvll mprod(vvll &a, vvll &b) {
int n = a.size();
vvll c(n, vll(n,0));
forn(i,0,n) {
forn(j,0,n) {
forn(k,0,n) {
c[i][j] = (c[i][j] +a[i][k] * b[k][j]) % mod;
}
}
}
return c;
}
vvll mexp(vvll & a, ll d) {
int n = a.size();
vvll res(n, vll(n,0));
vvll md = a;
forn(i,0,n) res[i][i] = 1;
while(d>0) {
if(d%2) {
res = mprod(res, md);
}
d /= 2;
md = mprod(md, md);
}
return res;
}
int main()
{
int h,w;
ll k;
scanf("%d %d %lld\n" ,&h,&w,&k);
if(k==0) {
cout<<1;
return 0;
}
ll cnt = 0;
forn(i,0,h) {
scanf("%s\n", a[i]);
forn(j,0,w) if(a[i][j] == '#') cnt++;
}
bool hor = false;
bool ver = false;
forn(i,0,w) {
if(a[0][i] == '#' && a[h-1][i] == '#') ver = true;
}
forn(i,0,h) {
if(a[i][0] == '#' && a[i][w-1] == '#') hor = true;
}
if(hor&&ver) {
cout<<1<<endl;
return 0;
}
if(hor == false && ver == false) {
ll ans = powM(cnt, k-1, mod);
cout<<ans;
return 0;
}
if(hor) {
ll IL = 0;
ll OL = 0;
forn(i,0,h) if(a[i][0]=='#' && a[i][w-1]=='#') OL++;
forn(i,0,h) forn(j,0,w-1) if(a[i][j]=='#' && a[i][j+1]=='#') IL++;
vvll m(2, vll(2,0));
m[0][0] = OL;
m[0][1] = IL;
m[1][1] = cnt;
vvll res = mexp(m, k-1);
cout<< (mod - res[0][1] + res[1][1])%mod << endl;
return 0;
}
if(ver) {
ll IL = 0;
ll OL = 0;
forn(j,0,w) if(a[0][j]=='#' && a[h-1][j]=='#') OL++;
forn(i,0,h-1) forn(j,0,w) if(a[i][j]=='#' && a[i+1][j]=='#') IL++;
vvll m(2, vll(2,0));
m[0][0] = OL;
m[0][1] = IL;
m[1][1] = cnt;
vvll res = mexp(m, k-1);
cout<< (mod - res[0][1] + res[1][1])%mod << endl;
return 0;
}
}
Submission Info
Submission Time |
|
Task |
F - Fraction of Fractal |
User |
Vercingetorix |
Language |
C++14 (GCC 5.4.1) |
Score |
1700 |
Code Size |
3242 Byte |
Status |
AC |
Exec Time |
14 ms |
Memory |
1280 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:85:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %lld\n" ,&h,&w,&k);
^
./Main.cpp:92:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s\n", a[i]);
^
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 |
12 ms |
1280 KB |
02.txt |
AC |
14 ms |
1280 KB |
03.txt |
AC |
14 ms |
1280 KB |
04.txt |
AC |
14 ms |
1280 KB |
05.txt |
AC |
14 ms |
1280 KB |
06.txt |
AC |
12 ms |
1280 KB |
07.txt |
AC |
12 ms |
1280 KB |
08.txt |
AC |
12 ms |
1280 KB |
09.txt |
AC |
14 ms |
1280 KB |
10.txt |
AC |
14 ms |
1280 KB |
11.txt |
AC |
12 ms |
1280 KB |
12.txt |
AC |
13 ms |
1280 KB |
13.txt |
AC |
13 ms |
1280 KB |
14.txt |
AC |
12 ms |
1280 KB |
15.txt |
AC |
12 ms |
1280 KB |
16.txt |
AC |
12 ms |
1280 KB |
17.txt |
AC |
14 ms |
1280 KB |
18.txt |
AC |
14 ms |
1280 KB |
19.txt |
AC |
14 ms |
1280 KB |
20.txt |
AC |
14 ms |
1280 KB |
21.txt |
AC |
14 ms |
1280 KB |
22.txt |
AC |
12 ms |
1280 KB |
23.txt |
AC |
13 ms |
1280 KB |
24.txt |
AC |
13 ms |
1280 KB |
25.txt |
AC |
13 ms |
1280 KB |
26.txt |
AC |
13 ms |
1280 KB |
27.txt |
AC |
13 ms |
1280 KB |
28.txt |
AC |
13 ms |
1280 KB |
29.txt |
AC |
4 ms |
256 KB |
30.txt |
AC |
5 ms |
256 KB |
31.txt |
AC |
4 ms |
256 KB |
32.txt |
AC |
6 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 |