結果
問題 | No.1340 おーじ君をさがせ |
ユーザー |
|
提出日時 | 2021-01-15 22:04:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 121 ms / 2,000 ms |
コード長 | 4,436 bytes |
コンパイル時間 | 2,975 ms |
コンパイル使用メモリ | 199,160 KB |
最終ジャッジ日時 | 2025-01-17 19:26:06 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 59 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define REP(i, n) for(int i=0; i<(n); ++i)#define RREP(i, n) for(int i=(n);i>=0;--i)#define FOR(i, a, n) for (int i=(a); i<(n); ++i)#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)#define SZ(x) ((int)(x).size())#define ALL(x) (x).begin(),(x).end()#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {REP(i, SZ(v)) {if (i) os << " ";os << v[i];}return os;}template <class T>void debug(const vector<T> &v) {cout << "[";REP(i, SZ(v)) {if(i) cout << ", ";cout << v[i];}cout << "]" << endl;}template<class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {return os << p.first << " " << p.second;}template <class T, class U>void debug(const pair<T, U> &p) {cout << "(" << p.first << " " << p.second << ")" << endl;}template<class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template<class T>bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}using ll = long long;using ull = unsigned long long;using ld = long double;using P = pair<int, int>;using vi = vector<int>;using vll = vector<ll>;using vvi = vector<vi>;using vvll = vector<vll>;const ll MOD = 1e9 + 7;const ll MOD998 = 998244353;const int INF = INT_MAX;const ll LINF = LLONG_MAX;const int inf = INT_MIN;const ll linf = LLONG_MIN;const ld eps = 1e-9;template<int m>struct mint {int x;mint(ll x = 0) : x(((x % m) + m) % m) {}mint operator-() const { return x ? m - x : 0; }mint &operator+=(mint r) {if ((x += r.x) >= m) x -= m;return *this;}mint &operator-=(mint r) {if ((x -= r.x) < 0) x += m;return *this;}mint &operator*=(mint r) {x = ((ll) x * r.x) % m;return *this;}mint inv() const { return pow(m - 2); }mint &operator/=(mint r) { return *this *= r.inv(); }friend mint operator+(mint l, mint r) { return l += r; }friend mint operator-(mint l, mint r) { return l -= r; }friend mint operator*(mint l, mint r) { return l *= r; }friend mint operator/(mint l, mint r) { return l /= r; }mint pow(ll n) const {mint ret = 1, tmp = *this;while (n) {if (n & 1) ret *= tmp;tmp *= tmp, n >>= 1;}return ret;}friend bool operator==(mint l, mint r) { return l.x == r.x; }friend bool operator!=(mint l, mint r) { return l.x != r.x; }friend ostream &operator<<(ostream &os, mint a) {return os << a.x;}friend istream &operator>>(istream &is, mint &a) {ll x;is >> x;a = x;return is;}};using Int = mint<MOD>;/*** @brief* 行列累乗* @author habara-k* @date 2020/04/24* @param[in] a 行列* @param[in] k 指数* @return 行列 a^k** @details* T に渡すのは環であり、operator *, += を定義すること*/template<class T>using Matrix = vector<vector<T>>;template<class T>Matrix<T> operator*(const Matrix<T> &A, const Matrix<T> &B) {assert(A[0].size() == B.size());int n = A.size(), m = B[0].size(), p = A[0].size();Matrix<T> C(n, vector<T>(m));for (int i = 0; i < n; ++i)for (int j = 0; j < m; ++j)for (int k = 0; k < p; ++k) {C[i][j] += A[i][k] * B[k][j];if(C[i][j]) C[i][j] = 1;}return C;}template<class T>Matrix<T> pow(Matrix<T> a, ll k) {assert(a.size() == a[0].size());int n = a.size();Matrix<T> ret(n, vector<T>(n));for (int i = 0; i < n; ++i) ret[i][i] = 1;while (k) {if (k & 1) ret = ret * a;a = a * a;k >>= 1;}return ret;}int main() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(10);int n, m; ll t; cin >> n >> m >> t;Matrix<int> g(n, vi(n));REP(i, m) {int a, b; cin >> a >> b;g[a][b] = 1;}g = pow(g, t);int cnt = 0;REP(i, n) {cnt += g[0][i];}cout << cnt << endl;return 0;}