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

• 問題: No.1340 おーじ君をさがせ
• ユーザー: 🍮かんプリン
• 提出日時: 2021-01-16 17:50:49
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 313 ms / 2,000 ms
• コード長: 4,438 bytes
• コンパイル時間: 1,783 ms
• コンパイル使用メモリ: 173,864 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-27 23:34:03
• 合計ジャッジ時間: 7,380 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	1 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	3 ms; 5,248 KB
testcase_11	AC	56 ms; 5,248 KB
testcase_12	AC	10 ms; 5,248 KB
testcase_13	AC	41 ms; 5,248 KB
testcase_14	AC	125 ms; 5,248 KB
testcase_15	AC	93 ms; 5,248 KB
testcase_16	AC	8 ms; 5,248 KB
testcase_17	AC	31 ms; 5,248 KB
testcase_18	AC	58 ms; 5,248 KB
testcase_19	AC	5 ms; 5,248 KB
testcase_20	AC	2 ms; 5,248 KB
testcase_21	AC	59 ms; 5,248 KB
testcase_22	AC	155 ms; 5,248 KB
testcase_23	AC	64 ms; 5,248 KB
testcase_24	AC	299 ms; 5,248 KB
testcase_25	AC	10 ms; 5,248 KB
testcase_26	AC	6 ms; 5,248 KB
testcase_27	AC	5 ms; 5,248 KB
testcase_28	AC	12 ms; 5,248 KB
testcase_29	AC	3 ms; 5,248 KB
testcase_30	AC	66 ms; 5,248 KB
testcase_31	AC	300 ms; 5,248 KB
testcase_32	AC	288 ms; 5,248 KB
testcase_33	AC	279 ms; 5,248 KB
testcase_34	AC	246 ms; 5,248 KB
testcase_35	AC	313 ms; 5,248 KB
testcase_36	AC	2 ms; 5,248 KB
testcase_37	AC	5 ms; 5,248 KB
testcase_38	AC	302 ms; 5,248 KB
testcase_39	AC	76 ms; 5,248 KB
testcase_40	AC	80 ms; 5,248 KB
testcase_41	AC	84 ms; 5,248 KB
testcase_42	AC	2 ms; 5,248 KB
testcase_43	AC	1 ms; 5,248 KB
testcase_44	AC	2 ms; 5,248 KB
testcase_45	AC	2 ms; 5,248 KB
testcase_46	AC	57 ms; 5,248 KB
testcase_47	AC	63 ms; 5,248 KB
testcase_48	AC	68 ms; 5,248 KB
testcase_49	AC	65 ms; 5,248 KB
testcase_50	AC	67 ms; 5,248 KB
testcase_51	AC	72 ms; 5,248 KB
testcase_52	AC	133 ms; 5,248 KB
testcase_53	AC	126 ms; 5,248 KB
testcase_54	AC	134 ms; 5,248 KB
testcase_55	AC	98 ms; 5,248 KB
testcase_56	AC	1 ms; 5,248 KB
testcase_57	AC	2 ms; 5,248 KB
testcase_58	AC	2 ms; 5,248 KB
testcase_59	AC	40 ms; 5,248 KB
testcase_60	AC	1 ms; 5,248 KB
testcase_61	AC	41 ms; 5,248 KB

ソースコード

/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2021.01.16 17:50:34
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

template< class T >
struct Matrix {
    std::vector< std::vector< T > > A;
    Matrix() {}
    Matrix(size_t n, size_t m) : A(n, std::vector< T >(m, 0)) {}
    Matrix(size_t n) : A(n, std::vector< T >(n, 0)) {};
    size_t height() const {
        return (A.size());
    }
    size_t width() const {
        return (A[0].size());
    }
    inline const std::vector< T > &operator[](int k) const {
        return (A.at(k));
    }
    inline std::vector< T > &operator[](int k) {
        return (A.at(k));
    }
    static Matrix I(size_t n) {
        Matrix mat(n);
        for (int i = 0; i < n; i++) mat[i][i] = 1;
        return (mat);
    }
    Matrix &operator+=(const Matrix &B) {
        size_t n = height(), m = width();
        assert(n == B.height() && m == B.width());
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                (*this)[i][j] += B[i][j];
        return (*this);
    }
    Matrix &operator-=(const Matrix &B) {
        size_t n = height(), m = width();
        assert(n == B.height() && m == B.width());
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                (*this)[i][j] -= B[i][j];
        return (*this);
    }
    Matrix &operator*=(const Matrix &B) {
        size_t n = height(), m = B.width(), p = width();
        assert(p == B.height());
        std::vector< std::vector< T > > C(n, std::vector< T >(m, 0));
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                for (int k = 0; k < p; k++)
                    C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);
        A.swap(C);
        return (*this);
    }
    Matrix operator+(const Matrix &B) const {
        return (Matrix(*this) += B);
    }
    Matrix operator-(const Matrix &B) const {
        return (Matrix(*this) -= B);
    }
    Matrix operator*(const Matrix &B) const {
        return (Matrix(*this) *= B);
    }
    bool operator==(const Matrix &B) const {
        assert(this->A.size() == B.A.size() && this->A[0].size() == B.A[0].size());
        int n = this->A.size();
        int m = this->A[0].size();
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                if (this->A[i][j] != B.A[i][j]) return false;
        return true;
    }
    bool operator!=(const Matrix &B) const {
        return !(*this == B);
    }
    friend std::ostream &operator<<(std::ostream &os, Matrix &p) {
        size_t n = p.height(), m = p.width();
        for (int i = 0; i < n; i++) {
            os << "[";
            for (int j = 0; j < m; j++) {
                os << p[i][j] << (j + 1 == m ? "]\n" : ",");
            }
        }
        return (os);
    }
    
    T determinant() {
        Matrix B(*this);
        assert(width() == height());
        T ret = 1;
        for (int i = 0; i < width(); i++) {
            int idx = -1;
            for (int j = i; j < width(); j++) {
                if (B[j][i] != 0) idx = j;
            }
            if (idx == -1) return (0);
            if (i != idx) {
                ret *= -1;
                swap(B[i], B[idx]);
            }
            ret *= B[i][i];
            T vv = B[i][i];
            for (int j = 0; j < width(); j++) {
                B[i][j] /= vv;
            }
            for (int j = i + 1; j < width(); j++) {
                T a = B[j][i];
                for (int k = 0; k < width(); k++) {
                    B[j][k] -= B[i][k] * a;
                }
            }
        }
        return (ret);
    }
    
    
    Matrix pow(ll k) const {
        auto res = I(A.size());
        auto M = *this;
        while (k > 0) {
            if (k & 1) {
                res *= M;
            }
            M *= M;
            k >>= 1;
        }
        return res;
    }
};
struct A {
    int x;
    A(int x):x(x){}
    A operator*(const A &b) const {
        return A(this->x*b.x);
    }
    A operator+(const A &b) const {
        return A(min(1,this->x+b.x));
    }
};
int main() {
    ll n,m,t;cin >> n >> m >> t;
    Matrix<A> mat(n);
    for (int i = 0; i < m; i++) {
        int a,b;cin >> a >> b;
        mat[a][b] = 1;
    }
    int ans = 0;
    mat = mat.pow(t);
    for (int i = 0; i < n; i++) {
        ans += mat[0][i].x;
    }
    cout << ans << endl;
    return 0;
}