提出 #3949142

---

ソースコード 拡げる

#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
using namespace std;

#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)

#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9

typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;

#define N 50
#define MOD 1000000007

ll n, k;
ll a[N][N], b[N][N];
ll r1[N][N], r2[N][N];

void multi(ll a[N][N], ll b[N][N], ll c[N][N]) {
  rep(i, n) {
    rep(j, n) {
      c[i][j] = 0;
      rep(k, n) {
        c[i][j] += a[i][k] * b[k][j] % MOD;
      }
      c[i][j] %= MOD;
    }
  }
}

ll solve(ll k) {
  rep(i, n) rep(j, n) r1[i][j] = (i == j ? 1 : 0);
  while(k) {
    if(k & 1) {
      multi(r1, a, r2);
      rep(i, n) rep(j, n) r1[i][j] = r2[i][j];
    }
    multi(a, a, b);
    rep(i, n) rep(j, n) a[i][j] = b[i][j];
    k >>= 1;
  }
  ll res = 0;
  rep(i, n) rep(j, n) {
    res += r1[i][j];
    res %= MOD;
  }
  return res;
}

int main() {
  cin >> n >> k;
  rep(i, n) rep(j, n) cin >> a[i][j];
  cout << solve(k) << endl;
  return 0;
}

提出情報

ジャッジ結果