#604969 (C++17) No.1340 おーじ君をさがせ

• 問題: No.1340 おーじ君をさがせ
• ユーザー: Coki628
• 提出日時: 2021-01-16 02:25:43
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 5,307 bytes
• コンパイル時間: 2,159 ms
• コンパイル使用メモリ: 212,448 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-05 03:55:46
• 合計ジャッジ時間: 24,844 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	3 ms; 5,376 KB
testcase_11	AC	321 ms; 5,376 KB
testcase_12	AC	44 ms; 5,376 KB
testcase_13	AC	214 ms; 5,376 KB
testcase_14	AC	619 ms; 5,376 KB
testcase_15	AC	511 ms; 5,376 KB
testcase_16	AC	35 ms; 5,376 KB
testcase_17	AC	165 ms; 5,376 KB
testcase_18	AC	297 ms; 5,376 KB
testcase_19	AC	14 ms; 5,376 KB
testcase_20	AC	4 ms; 5,376 KB
testcase_21	AC	303 ms; 5,376 KB
testcase_22	AC	834 ms; 5,376 KB
testcase_23	AC	306 ms; 5,376 KB
testcase_24	AC	1,655 ms; 5,376 KB
testcase_25	AC	30 ms; 5,376 KB
testcase_26	AC	18 ms; 5,376 KB
testcase_27	AC	12 ms; 5,376 KB
testcase_28	AC	42 ms; 5,376 KB
testcase_29	AC	3 ms; 5,376 KB
testcase_30	AC	332 ms; 5,376 KB
testcase_31	AC	1,610 ms; 5,376 KB
testcase_32	AC	1,491 ms; 5,376 KB
testcase_33	AC	1,482 ms; 5,376 KB
testcase_34	AC	1,321 ms; 5,376 KB
testcase_35	AC	1,635 ms; 5,376 KB
testcase_36	AC	2 ms; 5,376 KB
testcase_37	AC	3 ms; 5,376 KB
testcase_38	AC	1,607 ms; 5,376 KB
testcase_39	AC	403 ms; 5,376 KB
testcase_40	AC	427 ms; 5,376 KB
testcase_41	AC	415 ms; 5,376 KB
testcase_42	AC	2 ms; 5,376 KB
testcase_43	AC	1 ms; 5,376 KB
testcase_44	AC	2 ms; 5,376 KB
testcase_45	AC	2 ms; 5,376 KB
testcase_46	AC	303 ms; 5,376 KB
testcase_47	AC	328 ms; 5,376 KB
testcase_48	AC	372 ms; 5,376 KB
testcase_49	AC	370 ms; 5,376 KB
testcase_50	AC	373 ms; 5,376 KB
testcase_51	AC	371 ms; 5,376 KB
testcase_52	AC	718 ms; 5,376 KB
testcase_53	AC	708 ms; 5,376 KB
testcase_54	AC	720 ms; 5,376 KB
testcase_55	AC	547 ms; 5,376 KB
testcase_56	AC	2 ms; 5,376 KB
testcase_57	AC	1 ms; 5,376 KB
testcase_58	WA	-
testcase_59	AC	210 ms; 5,376 KB
testcase_60	AC	2 ms; 5,376 KB
testcase_61	WA	-

ソースコード

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

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

using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vvl = vector<vector<ll>>;
using vvi = vector<vector<int>>;
using vvpll = vector<vector<pll>>;
#define rep(i, a, b) for (ll i=(a); i<(b); i++)
#define rrep(i, a, b) for (ll i=(a); i>(b); i--)
#define pb push_back
#define tostr to_string
#define ALL(A) A.begin(), A.end()
#define elif else if
// constexpr ll INF = LONG_LONG_MAX;
constexpr ll INF = 1e18;
constexpr ll MOD = 1000000009;

const string digits = "0123456789";
const string ascii_lowercase = "abcdefghijklmnopqrstuvwxyz";
const string ascii_uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string ascii_letters = ascii_lowercase + ascii_uppercase;

template<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }
template<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }
template<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N, vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }

vector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }

void print(ld out) { cout << fixed << setprecision(15) << out << '\n'; }
void print(double out) { cout << fixed << setprecision(15) << out << '\n'; }
template<typename T> void print(T out) { cout << out << '\n'; }
template<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\n'; }
template<typename T> void print(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\n' : ' '); } }
template<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }

void Yes() { print("Yes"); }
void No() { print("No"); }
void YES() { print("YES"); }
void NO() { print("NO"); }

ll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } }
ll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } }
pll divmod(ll a, ll b) { ll d = a / b; ll m = a % b; return {d, m}; }
template<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }
template<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }

template<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }
template<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }
template<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }

ll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }
int toint(char num) { return num - '0'; }
char tochar(int num) { return '0' + num; }
int ord(char c) { return (int)c; }
char chr(int a) { return (char)a; }

ll pow(ll x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; }
ll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }

int popcount(ll S) { return __builtin_popcountll(S); }
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }

template<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }
template<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }

// 行列累乗
template<typename T>
struct MatPow {

    const int MOD;

    MatPow(const int MOD) : MOD(MOD) {}

    vector<vector<T>> mat_dot(vector<vector<T>> &A, vector<vector<T>> &B) {
        int n1 = A.size();
        int n2 = A[0].size();
        int m2 = B[0].size();
        auto res = list2d(n1, m2, (T)0);
        rep(i, 0, n1) {
            rep(j, 0, m2) {
                rep(k, 0, n2) {
                    res[i][j] = (res[i][j] + (A[i][k] * B[k][j]) % MOD) % MOD;
                }
            }
        }
        return res;
    }
    
    vector<vector<T>> mat_pow(vector<vector<T>> mat, ll k) {
        int n = mat.size();
        auto res = list2d(n, n, (T)0);
        rep(i, 0, n) {
            res[i][i] = 1;
        }
        while (k > 0) {
            if (k & 1) {
                res = mat_dot(res, mat);
            }
            mat = mat_dot(mat, mat);
            k >>= 1;
        }
        return res;
    }

    vector<T> solve(vvl mat, vector<T> &_init, ll K) {
        int n = mat.size();
        auto init = list2d(n, 1, (T)0);
        rep(i, 0, n) init[i][0] = _init[i];
        auto res = mat_pow(mat, K);
        res = mat_dot(res, init);
        vector<T> ret(n, 0);
        rep(i, 0, n) {
            ret[i] = res[i][0];
        }
    return ret;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll N, M, T;
    cin >> N >> M >> T;
    auto G = list2d(N, N, 0LL);
    rep(i, 0, M) {
        ll u, v;
        cin >> u >> v;
        G[v][u] = 1;
    }

    vector<ll> init(N);
    init[0] = 1;
    MatPow<ll> mp(MOD);
    auto res = mp.solve(G, init, T);
    ll ans = 0;
    rep(i, 0, N) {
        if (res[i]) ans++;
    }
    print(ans);
    return 0;
}