Submission #3949953


Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

#ifdef DEBUG
#define debug(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
#else
#define debug(fmt, ...)
#endif

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}



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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


template <typename T>
void mat_pp(vector<vector<T>>& A) {
    int n = A.size(), m = A[0].size();
    printf("_ matrix %dx%d\n", n, m);
    for (int i=0; i<n; ++i) {
        for (int j=0; j<m; ++j) {
            printf(" %5g", (double)A[i][j]);
        }
        printf("\n");
    }
}

// assign
template <typename T>
void mat_assign(vector<vector<T>>& dest, vector<vector<T>>& src) {
    int n = src.size(), m = src[0].size();
    dest.resize(n);
    for (int i=0; i<n; ++i) {
        dest[i] = src[i];
    }
}

template <typename T>
void mat_assign_zero(vector<vector<T>>& dest, int n, int m) {
    dest.resize(n);
    for (int i=0; i<n; ++i) {
        dest[i].assign(m, (T)0);
    }
}

template <typename T>
void mat_assign_eye(vector<vector<T>>& dest, int n) {
    dest.resize(n);
    for (int i=0; i<n; ++i) {
        dest[i].assign(n, (T)0);
        dest[i][i] = (T)1;
    }
}

// mul
template <typename T>
void mat_assign_mul(vector<vector<T>>& dest, vector<vector<T>>& A, vector<vector<T>>& B) {
    int an = A.size(), am = A[0].size();
    int bn = B.size(), bm = B[0].size();
    assert(am == bn);
    // vector<vector<T>> C(an, vector<T>(bm, (T)0));
    // printf("* mat mul (%d %d)x(%d %d)\n", an,am, bn,bm);
    // mat_pp(A); mat_pp(B);

    mat_assign_zero(dest, an, bm);
    for (int i=0; i<an; ++i) {
        for (int k=0; k<am; ++k) {
            for (int j=0; j<bm; ++j) {
                (dest[i][j] += MUL(A[i][k], B[k][j])) %= MOD;
            }
        }
    }
    // mat_pp(dest);
}

template <typename T>
vector<vector<T>> mat_mul(vector<vector<T>>& A, vector<vector<T>>& B) {
    int an = A.size(), am = A[0].size();
    int bn = B.size(), bm = B[0].size();
    assert(am == bn);
    vector<vector<T>> C; // (an, vector<T>(bm, (T)0));
    mat_assign_mul(C, A, B);
    return C;
}

template <typename T>
void mat_s_mul(vector<vector<T>>& A, vector<vector<T>>& B) {
    int an = A.size(), am = A[0].size();
    int bn = B.size(), bm = B[0].size();
    assert(am == bn);

    vector<vector<T>> A_copy;
    mat_assign(A_copy, A);
    mat_assign_mul(A, A_copy, B);
}

template <typename T>
void mat_s_pow2(vector<vector<T>>& A) {
    int an = A.size(), am = A[0].size();
    assert(an == am);

    vector<vector<T>> A_copy;
    mat_assign(A_copy, A);
    mat_assign_mul(A, A_copy, A_copy);
}

template <typename T>
vector<vector<T>> mat2_mul(vector<vector<T>>& A, vector<vector<T>>& B) {
    int an = A.size(), am = A[0].size();
    int bn = B.size(), bm = B[0].size();
    assert(an == 2 && am == 2 && bn == 2 && bm == 2);
    vector<vector<T>> C(2, vector<T>(2, (T)0));
    C[0][0] = A[0][0]*B[0][0] + A[0][1]*B[1][0];
    C[0][1] = A[0][0]*B[0][1] + A[0][1]*B[1][1];
    C[1][0] = A[1][0]*B[0][0] + A[1][1]*B[1][0];
    C[1][1] = A[1][0]*B[0][1] + A[1][1]*B[1][1];
    return C;
}

template <typename T>
vector<T> mat_mul(vector<vector<T>>& A, vector<T>& x) {
    int an = A.size(), am = A[0].size();
    int xn = x.size();
    assert(am == xn);
    vector<T> y(an, (T)0);
    for (int i=0; i<an; ++i) {
        for (int k=0; k<am; ++k) {
            y[i] += A[i][k] * x[k];
        }
    }
    return y;
}


template <typename T>
vector<vector<T>> mat_pow(vector<vector<T>>& A, long long p=2) { // A^p
    int an = A.size(), am = A[0].size();
    assert(an == am);
    // printf("mat pow\n");
    // mat_pp(A);
    // printf("^ %lld =\n", p);

    if (p == 0) {
        vector<vector<T>> E;
        mat_assign_eye(E, an);
        // mat_pp(E);
        return E;
    }

    vector<vector<T>> U;
    mat_assign(U, A);
    if (p == 1) {
        // mat_pp(U);
        return U;
    }

    vector<vector<T>> R;
    mat_assign_eye(R, an);

    while (p) {
        if (p % 2) {
            mat_s_mul(R, U); // v *= u
            --p;
        } else {
            mat_s_pow2(U); // u ^= 2
            p /= 2;
        }
    }
    // mat_pp(R);
    return R;
}

// planar
template <typename T>
vector<T> mat_inner(vector<T>& x, vector<T>& y) { // <x|y>
    int xn = x.size(), yn = y.size();
    assert(xn == yn);
    vector<T> z(xn, (T)0);
    for (int i=0; i<xn; ++i) {
        z[i] = x[i] * y[i];
    }
    return z;
}

ll solve(int N, ll K, vector<vll>& A) {
    // cerr << N << " " << K << A << endl;
    vector<vll> U = mat_pow(A, K);
    vll x(N, 1);
    vll y = mat_mul(U, x);
    // cerr << y << endl;
    return accumulate(ALL(y), 0LL) % MOD;
}

int main() {
    int N; ll K; scanf("%d%lld", &N, &K); read_cr();
    vector<vll> A(N, vll(N));
    rep(i,N) rep(j,N) scanf("%lld", &A[i][j]);
    cout << solve(N,K,A) << endl;
    return 0;
}

Submission Info

Submission Time
Task R - Walk
User naoya_t
Language C++14 (GCC 5.4.1)
Score 100
Code Size 9300 Byte
Status
Exec Time 54 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:107:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     fgets(_buf, 256, stdin);
                            ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:333:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int N; ll K; scanf("%d%lld", &N, &K); read_cr();
                                         ^
./Main.cpp:335:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     rep(i,N) rep(j,N) scanf("%lld", &A[i][j]);
                                              ^

Test Cases

Set Name Score / Max Score Test Cases
All 100 / 100 0_00, 0_01, 0_02, 0_03, 0_04, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 1_15, 1_16, 1_17
Case Name Status Exec Time Memory
0_00 1 ms 256 KB
0_01 1 ms 256 KB
0_02 1 ms 256 KB
0_03 1 ms 256 KB
0_04 1 ms 256 KB
1_00 1 ms 256 KB
1_01 1 ms 256 KB
1_02 1 ms 256 KB
1_03 38 ms 384 KB
1_04 1 ms 256 KB
1_05 38 ms 384 KB
1_06 1 ms 256 KB
1_07 54 ms 384 KB
1_08 28 ms 384 KB
1_09 38 ms 384 KB
1_10 39 ms 384 KB
1_11 36 ms 384 KB
1_12 35 ms 256 KB
1_13 43 ms 384 KB
1_14 40 ms 384 KB
1_15 41 ms 384 KB
1_16 42 ms 384 KB
1_17 41 ms 384 KB