結果

問題 No.1112 冥界の音楽
ユーザー LayCurseLayCurse
提出日時 2020-07-10 21:45:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 13 ms / 2,000 ms
コード長 10,369 bytes
コンパイル時間 2,751 ms
コンパイル使用メモリ 219,800 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-11 08:42:08
合計ジャッジ時間 3,846 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 3 ms
5,248 KB
testcase_10 AC 3 ms
5,248 KB
testcase_11 AC 3 ms
5,248 KB
testcase_12 AC 3 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 5 ms
5,248 KB
testcase_15 AC 3 ms
5,248 KB
testcase_16 AC 2 ms
5,248 KB
testcase_17 AC 3 ms
5,248 KB
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 3 ms
5,248 KB
testcase_20 AC 2 ms
5,248 KB
testcase_21 AC 5 ms
5,248 KB
testcase_22 AC 5 ms
5,248 KB
testcase_23 AC 4 ms
5,248 KB
testcase_24 AC 2 ms
5,248 KB
testcase_25 AC 2 ms
5,248 KB
testcase_26 AC 2 ms
5,248 KB
testcase_27 AC 2 ms
5,248 KB
testcase_28 AC 3 ms
5,248 KB
testcase_29 AC 2 ms
5,248 KB
testcase_30 AC 4 ms
5,248 KB
testcase_31 AC 3 ms
5,248 KB
testcase_32 AC 5 ms
5,248 KB
testcase_33 AC 2 ms
5,248 KB
testcase_34 AC 3 ms
5,248 KB
testcase_35 AC 3 ms
5,248 KB
testcase_36 AC 13 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define MD (1000000007U)
void *wmem;
char memarr[96000000];
template<class S, class T> inline S min_L(S a,T b){
  return a<=b?a:b;
}
struct Modint{
  unsigned val;
  Modint(){
    val=0;
  }
  Modint(int a){
    val = ord(a);
  }
  Modint(unsigned a){
    val = ord(a);
  }
  Modint(long long a){
    val = ord(a);
  }
  Modint(unsigned long long a){
    val = ord(a);
  }
  inline unsigned ord(unsigned a){
    return a%MD;
  }
  inline unsigned ord(int a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned ord(unsigned long long a){
    return a%MD;
  }
  inline unsigned ord(long long a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned get(){
    return val;
  }
  inline Modint &operator+=(Modint a){
    val += a.val;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator-=(Modint a){
    if(val < a.val){
      val = val + MD - a.val;
    }
    else{
      val -= a.val;
    }
    return *this;
  }
  inline Modint &operator*=(Modint a){
    val = ((unsigned long long)val*a.val)%MD;
    return *this;
  }
  inline Modint &operator/=(Modint a){
    return *this *= a.inverse();
  }
  inline Modint operator+(Modint a){
    return Modint(*this)+=a;
  }
  inline Modint operator-(Modint a){
    return Modint(*this)-=a;
  }
  inline Modint operator*(Modint a){
    return Modint(*this)*=a;
  }
  inline Modint operator/(Modint a){
    return Modint(*this)/=a;
  }
  inline Modint operator+(int a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(int a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(int a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(int a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator+(long long a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(long long a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(long long a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(long long a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator-(void){
    Modint res;
    if(val){
      res.val=MD-val;
    }
    else{
      res.val=0;
    }
    return res;
  }
  inline operator bool(void){
    return val!=0;
  }
  inline operator int(void){
    return get();
  }
  inline operator long long(void){
    return get();
  }
  inline Modint inverse(){
    int a = val;
    int b = MD;
    int u = 1;
    int v = 0;
    int t;
    Modint res;
    while(b){
      t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    if(u < 0){
      u += MD;
    }
    res.val = u;
    return res;
  }
  inline Modint pw(unsigned long long b){
    Modint a(*this);
    Modint res;
    res.val = 1;
    while(b){
      if(b&1){
        res *= a;
      }
      b >>= 1;
      a *= a;
    }
    return res;
  }
  inline bool operator==(int a){
    return ord(a)==val;
  }
  inline bool operator!=(int a){
    return ord(a)!=val;
  }
}
;
inline Modint operator+(int a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(int a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(int a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(int a, Modint b){
  return Modint(a)/=b;
}
inline Modint operator+(long long a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(long long a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(long long a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(long long a, Modint b){
  return Modint(a)/=b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
template<class T> struct Matrix{
  int r;
  int c;
  int mem;
  T *dat;
  Matrix(){
    r=c=mem = 0;
  }
  Matrix(const int rr, const int cc){
    if(rr == 0 || cc == 0){
      r = c = 0;
    }
    else{
      r = rr;
      c = cc;
    }
    mem = r * c;
    if(mem > 0){
      dat = new T[mem];
    }
  }
  Matrix(const Matrix<T> &a){
    int i;
    r = a.r;
    c = a.c;
    mem = r * c;
    dat = new T[mem];
    for(i=(0);i<(mem);i++){
      dat[i] = a.dat[i];
    }
  }
  ~Matrix(){
    if(mem){
      delete [] dat;
    }
  }
  void changeSize(const int rr, const int cc){
    if(rr==0 || cc==0){
      r = c = 0;
    }
    else{
      r = rr;
      c = cc;
    }
    if(mem < r*c){
      if(mem){
        delete [] dat;
      }
      mem = r*c;
      dat = new T[mem];
    }
  }
  Matrix<T>& operator=(const Matrix<T> &a){
    int i;
    int j;
    r = a.r;
    c = a.c;
    j = r * c;
    changeSize(r,c);
    for(i=(0);i<(j);i++){
      dat[i] = a.dat[i];
    }
    return *this;
  }
  Matrix<T>& operator=(const int a){
    int i;
    int j;
    j = r * c;
    for(i=(0);i<(j);i++){
      dat[i] = 0;
    }
    j =min_L(r, c);
    for(i=(0);i<(j);i++){
      dat[i*c+i] = a;
    }
    return *this;
  }
  Matrix<T>& operator+=(const Matrix<T> &a){
    int i;
    int j;
    if(r==0 || r!=a.r || c!=a.c){
      changeSize(0,0);
      return *this;
    }
    j = r*c;
    for(i=(0);i<(j);i++){
      dat[i] += a.dat[i];
    }
    return *this;
  }
  Matrix<T> operator+(const Matrix<T> &a){
    return Matrix<T>(*this) += a;
  }
  Matrix<T>& operator-=(const Matrix<T> &a){
    int i;
    int j;
    if(r==0 || r!=a.r || c!=a.c){
      changeSize(0,0);
      return *this;
    }
    j = r*c;
    for(i=(0);i<(j);i++){
      dat[i] -= a.dat[i];
    }
    return *this;
  }
  Matrix<T> operator-(const Matrix<T> &a){
    return Matrix<T>(*this) -= a;
  }
  Matrix<T>& operator*=(const Matrix<T> &a){
    int i;
    int j;
    int k;
    int x;
    T *m;
    if(r==0 || c!=a.r){
      changeSize(0,0);
      return *this;
    }
    m = (T*)wmem;
    x = r * a.c;
    for(i=(0);i<(x);i++){
      m[i] = 0;
    }
    for(i=(0);i<(r);i++){
      for(k=(0);k<(c);k++){
        for(j=(0);j<(a.c);j++){
          m[i*a.c+j] += dat[i*c+k] * a.dat[k*a.c+j];
        }
      }
    }
    changeSize(r, a.c);
    for(i=(0);i<(x);i++){
      dat[i] = m[i];
    }
    return *this;
  }
  Matrix<T> operator*(const Matrix<T> &a){
    return Matrix<T>(*this) *= a;
  }
  Matrix<T>& operator*=(const int a){
    int i;
    int j;
    j = r * c;
    for(i=(0);i<(j);i++){
      dat[i] *= a;
    }
    return *this;
  }
  Matrix<T>& operator*=(const long long a){
    int i;
    int j;
    j = r * c;
    for(i=(0);i<(j);i++){
      dat[i] *= a;
    }
    return *this;
  }
  Matrix<T>& operator*=(const double a){
    int i;
    int j;
    j = r * c;
    for(i=(0);i<(j);i++){
      dat[i] *= a;
    }
    return *this;
  }
  inline T* operator[](const int a){
    return dat+a*c;
  }
}
;
template<class T> Matrix<T> operator*(const int a, const Matrix<T> &b){
  return Matrix<T>(b)*=a;
}
template<class T> Matrix<T> operator*(const Matrix<T> &b, const int a){
  return Matrix<T>(b)*=a;
}
template<class T> Matrix<T> operator*(const long long a, const Matrix<T> &b){
  return Matrix<T>(b)*=a;
}
template<class T> Matrix<T> operator*(const Matrix<T> &b, const long long a){
  return Matrix<T>(b)*=a;
}
template<class T> Matrix<T> operator*(const double a, const Matrix<T> &b){
  return Matrix<T>(b)*=a;
}
template<class T> Matrix<T> operator*(const Matrix<T> &b, const double a){
  return Matrix<T>(b)*=a;
}
template<class T, class S> inline Matrix<T> pow_L(Matrix<T> a, S b){
  int i;
  int j;
  Matrix<T> res;
  res.changeSize(a.r, a.c);
  res = 1;
  while(b){
    if(b&1){
      res *= a;
    }
    b >>= 1;
    a *= a;
  }
  return res;
}
template<class T, class S> inline T pow_L(T a, S b){
  T res = 1;
  res = 1;
  for(;;){
    if(b&1){
      res *= a;
    }
    b >>= 1;
    if(b==0){
      break;
    }
    a *= a;
  }
  return res;
}
inline double pow_L(double a, double b){
  return pow(a,b);
}
int K;
int M;
int P;
int Q;
int R;
long long N;
int main(){
  int Lj4PdHRW, i;
  wmem = memarr;
  Modint res = 0;
  Matrix<Modint> mt;
  rd(K);
  rd(M);
  rd(N);
  mt.changeSize(K*K, K*K);
  mt = 0;
  for(Lj4PdHRW=(0);Lj4PdHRW<(M);Lj4PdHRW++){
    rd(P);P += (-1);
    rd(Q);Q += (-1);
    rd(R);R += (-1);
    mt[P*K+Q][Q*K+R] += 1;
  }
  (mt = pow_L(mt,N-2));
  for(i=(0);i<(K);i++){
    int j;
    for(j=(0);j<(K);j++){
      res += mt[i][j*K];
    }
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// int K, M, P, Q, R;
// ll N;
// {
//   Modint res = 0;
//   Matrix<Modint> mt;
//   rd(K,M,N);
//   mt.changeSize(K*K, K*K);
//   mt = 0;
//   rep(M){
//     rd(P--, Q--, R--);
//     mt[P*K+Q][Q*K+R] += 1;
//   }
//   mt **= N-2;
// 
//   rep(i,K) rep(j,K) res += mt[i][j*K];
//   wt(res);
// }
0