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

• 問題: No.1340 おーじ君をさがせ
• ユーザー: T101010101
• 提出日時: 2023-03-08 11:54:53
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,751 ms / 2,000 ms
• コード長: 5,787 bytes
• コンパイル時間: 2,958 ms
• コンパイル使用メモリ: 269,824 KB
• 実行使用メモリ: 4,348 KB
• 最終ジャッジ日時: 2023-10-18 05:53:39
• 合計ジャッジ時間: 27,429 ms
• ジャッジサーバーID （参考情報）: judge12 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,348 KB
testcase_01	AC	2 ms; 4,348 KB
testcase_02	AC	2 ms; 4,348 KB
testcase_03	AC	2 ms; 4,348 KB
testcase_04	AC	2 ms; 4,348 KB
testcase_05	AC	2 ms; 4,348 KB
testcase_06	AC	2 ms; 4,348 KB
testcase_07	AC	2 ms; 4,348 KB
testcase_08	AC	2 ms; 4,348 KB
testcase_09	AC	2 ms; 4,348 KB
testcase_10	AC	3 ms; 4,348 KB
testcase_11	AC	317 ms; 4,348 KB
testcase_12	AC	49 ms; 4,348 KB
testcase_13	AC	238 ms; 4,348 KB
testcase_14	AC	674 ms; 4,348 KB
testcase_15	AC	559 ms; 4,348 KB
testcase_16	AC	38 ms; 4,348 KB
testcase_17	AC	182 ms; 4,348 KB
testcase_18	AC	326 ms; 4,348 KB
testcase_19	AC	16 ms; 4,348 KB
testcase_20	AC	4 ms; 4,348 KB
testcase_21	AC	327 ms; 4,348 KB
testcase_22	AC	895 ms; 4,348 KB
testcase_23	AC	328 ms; 4,348 KB
testcase_24	AC	1,736 ms; 4,348 KB
testcase_25	AC	31 ms; 4,348 KB
testcase_26	AC	19 ms; 4,348 KB
testcase_27	AC	13 ms; 4,348 KB
testcase_28	AC	47 ms; 4,348 KB
testcase_29	AC	4 ms; 4,348 KB
testcase_30	AC	357 ms; 4,348 KB
testcase_31	AC	1,733 ms; 4,348 KB
testcase_32	AC	1,616 ms; 4,348 KB
testcase_33	AC	1,595 ms; 4,348 KB
testcase_34	AC	1,433 ms; 4,348 KB
testcase_35	AC	1,751 ms; 4,348 KB
testcase_36	AC	2 ms; 4,348 KB
testcase_37	AC	3 ms; 4,348 KB
testcase_38	AC	1,728 ms; 4,348 KB
testcase_39	AC	434 ms; 4,348 KB
testcase_40	AC	454 ms; 4,348 KB
testcase_41	AC	455 ms; 4,348 KB
testcase_42	AC	2 ms; 4,348 KB
testcase_43	AC	2 ms; 4,348 KB
testcase_44	AC	2 ms; 4,348 KB
testcase_45	AC	2 ms; 4,348 KB
testcase_46	AC	331 ms; 4,348 KB
testcase_47	AC	352 ms; 4,348 KB
testcase_48	AC	393 ms; 4,348 KB
testcase_49	AC	392 ms; 4,348 KB
testcase_50	AC	394 ms; 4,348 KB
testcase_51	AC	393 ms; 4,348 KB
testcase_52	AC	763 ms; 4,348 KB
testcase_53	AC	742 ms; 4,348 KB
testcase_54	AC	762 ms; 4,348 KB
testcase_55	AC	577 ms; 4,348 KB
testcase_56	AC	2 ms; 4,348 KB
testcase_57	AC	2 ms; 4,348 KB
testcase_58	AC	2 ms; 4,348 KB
testcase_59	AC	228 ms; 4,348 KB
testcase_60	AC	2 ms; 4,348 KB
testcase_61	AC	228 ms; 4,348 KB

ソースコード

#pragma region Macros

// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx,avx2,fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")

#include <bits/extc++.h>
// #include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;
// #include <atcoder/fenwicktree>
// #include <atcoder/segtree>
// #include <atcoder/maxflow>
// #include <atcoder/all>
// using namespace atcoder;

// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;

#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const ll INFL = 1LL << 61;
// const int MOD = 998244353;
const int MOD = 1000000007;

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
}

class UnionFind {
public:

	UnionFind() = default;
    UnionFind(int n) : par(n), 
	    sz(n, 1) { iota(par.begin(), par.end(), 0); }

	int root(int x) {
		if (par[x] == x) return x;
		return (par[x] = root(par[x]));
	}

	bool unite(int x, int y) {
		int rx = root(x);
		int ry = root(y);

        if (rx == ry) return false;
		if (sz[rx] < sz[ry]) swap(rx, ry); // union by size 

		sz[rx] += sz[ry];
		par[ry] = rx;

        return true;
	}

	bool issame(int x, int y) {
		return (root(x) == root(y));
	}

	int size(int x) {
		return sz[root(x)];
	}

    vector<vector<int>> groups(int n) {
        vector<vector<int>> G(n);
        for (int x = 0; x < n; x++) {
            G[root(x)].push_back(x);
        }
		G.erase(
            remove_if(G.begin(), G.end(),
                [&](const vector<int>& v) { return v.empty(); }),
                    G.end());
        return G;
    }

private:
	vector<int> par;
	vector<int> sz;
};

template<int mod> class modint{
public:
    int val = 0;
    modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
    modint(const modint &r) { val = r.val; } // コピーコンストラクタ

    modint operator -(){ return modint(-val); } // 単項
    modint operator +(const modint &r) { return modint(*this) += r; }
    modint operator -(const modint &r) { return modint(*this) -= r; }
    modint operator *(const modint &r) { return modint(*this) *= r; }
    modint operator /(const modint &r) { return modint(*this) /= r; }

    modint &operator +=(const modint &r) {
        val += r.val;
        if (val >= mod) val -= mod;
        return *this;
    }
    modint &operator -=(const modint &r) {
        if (val < r.val) val += mod;
        val -= r.val;
        return *this;
    }
    modint &operator *=(const modint &r) {
        val = val * r.val % mod;
        return *this;
    }
    modint &operator /=(const modint &r) {
        int a = r.val, b = mod, u = 1, v = 0;
        while (b) {
            int t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % mod;
        if (val < 0) val += mod;
        return *this;
    }

    bool operator ==(const modint& r) { return this -> val == r.val; }
    bool operator <(const modint& r) { return this -> val < r.val; }
    bool operator !=(const modint& r) { return this -> val != r.val; }
};

using mint = modint<MOD>;

istream &operator >>(istream &is, mint& x) {
    int t; is >> t;
    x = t;
    return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
    return os << x.val;
}

mint modpow(const mint &a, int n) {
    if (n == 0) return 1;
    mint t = modpow(a, n / 2);
    t = t * t;
    if (n & 1) t = t * a;
    return t;
}

int modpow(int x, int N, int mod) {
    int ret = 1;
    while (N > 0) {
        if (N % 2 == 1) ret = ret * x % mod;
        x = x * x % mod;
        N /= 2;
    }
    return ret;
}

int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }

#pragma endregion

typedef vector<vector<int>> Matrix;

// n行k列のAとk行m列のBを渡すとn行m列のCが返る。O(N^3)
Matrix Mul(const Matrix &A, const Matrix &B, int MOD) {
    assert(A[0].size() == B.size());
    Matrix C(A.size(), vector<int> (B[0].size()));
    for (int i = 0; i < A.size(); i++) {
        for (int k = 0; k < B.size(); k++) {
            for (int j = 0; j < B[0].size(); j++) {
                C[i][j] += A[i][k] * B[k][j];
                C[i][j] %= MOD;
            }
        }
    }
    return C;
}

// N次正方行列AのK乗を求める。O(N^3 log K)
Matrix Pow(Matrix A, int K, int MOD) {
    assert(A.size() == A[0].size());
    Matrix B(A.size(), vector<int> (A.size()));
    for (int i = 0; i < A.size(); i++) {
        B[i][i] = 1;
    }
    while (K > 0) {
        if (K & 1) B = Mul(B, A, MOD);
        A = Mul(A, A, MOD);
        K >>= 1;
    }
    return B;
}

void PrintMatrix(const Matrix &A) {
    int h = A.size(), w = A[0].size();
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            cout << A[i][j] << ' ';
        }
        cout << endl;
    }
}

signed main() {
    int N, M, T;
    cin >> N >> M >> T;
    vector<vector<int>> A(N, vector<int>(N));
    for (int i = 0; i < M; i++) {
        int u, v;
        cin >> u >> v;
        // u--; v--;
        A[u][v] = 1;
    }

    Matrix P = Pow(A, T, MOD);
    int ans1 = 0;
    for (int i = 0; i < N; i++) {
        ans1 += (P[0][i] > 0);
    }
    // Matrix P2 = Pow(A, T, MOD2);
    // int ans2 = 0;
    // for (int i = 0; i < N; i++) {
    //     ans2 += (P2[0][i] > 0);
    // }
    Matrix P3 = Pow(A, T, 82589933LL);
    int ans3 = 0;
    for (int i = 0; i < N; i++) {
        ans3 += (P3[0][i] > 0);
    }

    cout << max(ans1, ans3) << endl;
}