Submission #847663


Source Code Expand

Copy
/**
 *    author:  [itmo] enot.1.10
 *    created: 21.08.2016 15:33:51       
**/
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define mp make_pair
#define forn(i, n) for(int i = 0 ; (i) < (n) ; ++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(),a.end()
#define pw(x) (1LL<<(x))

using namespace std;

typedef long long ll;
typedef double dbl;
typedef vector<int> vi;
typedef pair<int, int> pi;

const int inf = 1.01e9;
const dbl eps = 1e-9;

/* --- main part --- */

const int T = 3;
const int mod = 1e9 + 7;

ll tmp[T][T];
ll A[T][T], R[T][T];

void multRR()
{
    memset(tmp, 0, sizeof tmp);
    forn(i, T) forn(j, T) forn(k, T) tmp[i][j] = (tmp[i][j] + R[i][k] * (ll)R[k][j]) % mod;
    forn(i, T) forn(j, T) R[i][j] = tmp[i][j];
}

void multRA()
{
    memset(tmp, 0, sizeof tmp);
    forn(i, T) forn(j, T) forn(k, T) tmp[i][j] = (tmp[i][j] + R[i][k] * (ll)A[k][j]) % mod;
    forn(i, T) forn(j, T) R[i][j] = tmp[i][j];
}

int mpow(int a, ll b)
{
    int res = 1;
    while (b)
    {
        if (b & 1) res = (res * (ll)a) % mod;
        a = (a * (ll)a) % mod;
        b >>= 1;
    }
    return res;
}



const int N = 1010;

char s[N][N];


int main()
{
    #ifdef home
        assert(freopen("1.in", "r", stdin));
        assert(freopen("1.out", "w", stdout));
    #endif
    int n, m;
    scanf("%d%d", &n, &m);
    ll k;
    scanf("%lld", &k);
    if (k <= 1) return 0 * printf("1\n");
    forn(i, n) scanf("%s", s[i]);
    int V = 0, H = 0;
    forn(i, n) if (s[i][0] == '#' && s[i][m - 1] == '#') H++;
    forn(i, m) if (s[0][i] == '#' && s[n - 1][i] == '#') V++;
    if (H == 0 && V == 0)
    {
        int res = 0;
        forn(i, n) forn(j, m) res += s[i][j] == '#';
        res = mpow(res, k - 1);
        printf("%d\n", res);
        return 0;
    }
    if (H > 0 && V > 0) return 0 * printf("1\n");

    if (H == 0 && V > 0)
    {
        int mx = max(n, m);
        forn(i, mx) forn(j, mx) if (i < j) swap(s[i][j], s[j][i]);
        swap(n, m);
        swap(H, V);
    }
    ll cnt = 0;
    ll pairs = 0;
    ll sides = H;
    forn(i, n) forn(j, m) cnt += s[i][j] == '#';
    forn(i, n) forn(j, m - 1) if (s[i][j] == '#' && s[i][j + 1] == '#') pairs++;


    A[0][0] = cnt;
    A[1][1] = cnt;
    A[1][2] = pairs;
    A[2][2] = sides;

    forn(i, T) R[i][i] = 1;

    ll b = k - 2;
    for (int i = 60; i >= 0; --i)
    {
        multRR();
        if (b & pw(i)) multRA();
    }

    ll cnt2 = (cnt * (ll)R[0][0] + pairs * (ll)R[0][1] + sides * (ll)R[0][2]) % mod;
    ll pairs2 = (cnt * (ll)R[1][0] + pairs * (ll)R[1][1] + sides * (ll)R[1][2]) % mod;
    
    int res = (cnt2 - pairs2 + mod) % mod;

    printf("%d\n", res);

    
    #ifdef home
        eprintf("time = %d ms\n", (int)(clock() * 1000. / CLOCKS_PER_SEC));
    #endif
    return 0;
}

Submission Info

Submission Time
Task F - Fraction of Fractal
User enot
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 3049 Byte
Status AC
Exec Time 16 ms
Memory 1280 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:76:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
                          ^
./Main.cpp:78:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &k);
                      ^
./Main.cpp:80:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     forn(i, n) scanf("%s", s[i]);
                                 ^

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 10 ms 1280 KB
02.txt AC 13 ms 1280 KB
03.txt AC 15 ms 1280 KB
04.txt AC 13 ms 1280 KB
05.txt AC 15 ms 1280 KB
06.txt AC 11 ms 1280 KB
07.txt AC 11 ms 1280 KB
08.txt AC 10 ms 1280 KB
09.txt AC 13 ms 1280 KB
10.txt AC 15 ms 1280 KB
11.txt AC 10 ms 1280 KB
12.txt AC 12 ms 1280 KB
13.txt AC 13 ms 1280 KB
14.txt AC 11 ms 1280 KB
15.txt AC 11 ms 1280 KB
16.txt AC 11 ms 1280 KB
17.txt AC 13 ms 1280 KB
18.txt AC 13 ms 1280 KB
19.txt AC 13 ms 1280 KB
20.txt AC 15 ms 1280 KB
21.txt AC 16 ms 1280 KB
22.txt AC 11 ms 1280 KB
23.txt AC 15 ms 1280 KB
24.txt AC 15 ms 1280 KB
25.txt AC 15 ms 1280 KB
26.txt AC 14 ms 1280 KB
27.txt AC 15 ms 1280 KB
28.txt AC 12 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