結果

問題 No.1340 おーじ君をさがせ
ユーザー stoqstoq
提出日時 2021-01-17 16:39:25
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 206 ms / 2,000 ms
コード長 3,340 bytes
コンパイル時間 2,700 ms
コンパイル使用メモリ 209,036 KB
最終ジャッジ日時 2025-01-18 01:39:25
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 59
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#pragma region Macros

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

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

using Matrix = vector<vector<int>>;

Matrix Matprod(Matrix &A, Matrix &B)
{
  int l = A.size();
  int m = A[0].size();
  int n = B[0].size();
  assert(m == B.size());
  Matrix res(l, vector<int>(n, 0));
  rep(i, l) rep(j, n)
  {
    rep(k, m)
    {
      res[i][j] |= A[i][k] && B[k][j];
    }
  }
  return res;
}

Matrix Matpow(Matrix &A, ll n)
{
  Matrix res = A, P = A;
  rep(i, A.size()) rep(j, A.size()) res[i][j] = i == j;
  while (n)
  {
    if (n & 1)
    {
      res = Matprod(res, P);
    }
    P = Matprod(P, P);
    n >>= 1;
  }
  return res;
}

void solve()
{
  int n, m;
  ll t;
  cin >> n >> m >> t;
  Matrix A(n, vector<int>(n, 0));
  rep(i, m)
  {
    int a, b;
    cin >> a >> b;
    A[b][a] = 1;
  }
  A = Matpow(A, t);
  Matrix ans(n, vector<int>(1, 0));
  ans[0][0] = 1;
  ans = Matprod(A, ans);
  int cnt = 0;
  rep(i, n) cnt += ans[i][0];
  cout << cnt << "\n";
}

int main()
{
  solve();
}
0