結果

問題 No.1340 おーじ君をさがせ
ユーザー rokahikou1rokahikou1
提出日時 2021-01-28 00:10:23
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 7,538 bytes
コンパイル時間 1,850 ms
コンパイル使用メモリ 174,208 KB
実行使用メモリ 4,500 KB
最終ジャッジ日時 2023-09-07 06:56:47
合計ジャッジ時間 9,137 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 RE -
testcase_11 AC 61 ms
4,376 KB
testcase_12 AC 8 ms
4,376 KB
testcase_13 AC 48 ms
4,380 KB
testcase_14 AC 130 ms
4,376 KB
testcase_15 AC 106 ms
4,376 KB
testcase_16 AC 6 ms
4,376 KB
testcase_17 AC 36 ms
4,376 KB
testcase_18 AC 63 ms
4,380 KB
testcase_19 AC 5 ms
4,376 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 AC 1 ms
4,376 KB
testcase_37 RE -
testcase_38 RE -
testcase_39 AC 78 ms
4,380 KB
testcase_40 AC 85 ms
4,376 KB
testcase_41 AC 85 ms
4,380 KB
testcase_42 AC 2 ms
4,380 KB
testcase_43 AC 1 ms
4,376 KB
testcase_44 AC 2 ms
4,380 KB
testcase_45 AC 1 ms
4,376 KB
testcase_46 AC 52 ms
4,376 KB
testcase_47 AC 54 ms
4,376 KB
testcase_48 AC 59 ms
4,376 KB
testcase_49 AC 71 ms
4,376 KB
testcase_50 AC 68 ms
4,376 KB
testcase_51 AC 68 ms
4,376 KB
testcase_52 AC 148 ms
4,376 KB
testcase_53 AC 145 ms
4,380 KB
testcase_54 AC 148 ms
4,376 KB
testcase_55 AC 96 ms
4,380 KB
testcase_56 RE -
testcase_57 AC 2 ms
4,376 KB
testcase_58 AC 1 ms
4,376 KB
testcase_59 AC 45 ms
4,380 KB
testcase_60 AC 2 ms
4,376 KB
testcase_61 AC 46 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    read(__VA_ARGS__)
#define LL(...)                                                                \
    ll __VA_ARGS__;                                                            \
    read(__VA_ARGS__)
#define DOUBLE(...)                                                            \
    double __VA_ARGS__;                                                        \
    read(__VA_ARGS__)
#define CHAR(...)                                                              \
    char __VA_ARGS__;                                                          \
    read(__VA_ARGS__)
#define STRING(...)                                                            \
    string __VA_ARGS__;                                                        \
    read(__VA_ARGS__)
#define VEC(type, name, size)                                                  \
    vector<type> name(size);                                                   \
    read(name)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
template <class T> inline vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> inline auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}

void read() {}
template <class T> inline void read(T &a) { cin >> a; }
template <class T, class S> inline void read(pair<T, S> &p) {
    read(p.first), read(p.second);
}
template <class T> inline void read(vector<T> &v) {
    for(auto &a : v)
        read(a);
}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
    read(head), read(tail...);
}
template <class T> inline void chmax(T &a, T &b) { (a < b ? a = b : a); }
template <class T> inline void chmin(T &a, T &b) { (a > b ? a = b : a); }

#include <cassert>
// 参考:https://ei1333.github.io/luzhiled/snippets/math/matrix.html
// (掛け算と累乗)https://yukicoder.me/submissions/523126
// 他は知らん
template <class T> struct Matrix {
    vector<vector<T>> A;
    Matrix() {}
    Matrix(size_t n, size_t m) : A(n, vector<T>(m, 0)) {}
    Matrix(size_t n) : A(n, vector<T>(n, 0)) {}

    size_t height() const { return A.size(); }

    size_t width() const { return A[0].size(); }

    inline vector<T> &operator[](int k) { return A.at(k); }
    inline const vector<T> &operator[](int k) const { 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 h = height(), w = width();
        assert(h == B.height() && w == B.width);
        for(int i = 0; i < h; i++) {
            for(int j = 0; j < w; j++) {
                (*this)[i][j] += B[i][j];
            }
        }
        return *this;
    }

    Matrix &operator-=(const Matrix &B) {
        size_t h = height(), w = width();
        assert(h == B.height() && w == B.width);
        for(int i = 0; i < h; i++) {
            for(int j = 0; j < w; j++) {
                (*this)[i][j] -= B[i][j];
            }
        }
        return *this;
    }

    Matrix &operator*=(const Matrix &B) {
        size_t h = height(), w = B.width(), p = width();
        assert(p == B.height());
        vector<vector<T>> C(h, vector<T>(w, 0));
        for(int i = 0; i < h; i++) {
            for(int j = 0; j < w; 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^=(ll k) {
        Matrix B = Matrix::I(height());
        while(k > 0) {
            if(k & 1)
                B *= *this;
            *this *= *this;
            k >>= 1LL;
        }
        A.swap(B.A);
        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); }
    Matrix operator^(const ll k) const { return (Matrix(*this) ^= k); }

    friend ostream &operator<<(ostream &os, const Matrix &p) {
        size_t h = p.height(), w = p.width();
        for(int i = 0; i < h; i++) {
            os << "[";
            for(int j = 0; j < w; j++) {
                os << p[i][j] << (j + 1 == w ? "]\n" : ",");
            }
        }
        return os;
    }
};

template <uint_fast64_t MOD> class ModInt {
    using u64 = uint_fast64_t;

  public:
    u64 val;

    ModInt(const u64 x = 0) : val((x + MOD) % MOD) {}
    constexpr u64 &value() { return val; }
    constexpr ModInt operator-() { return val ? MOD - val : 0; }
    constexpr ModInt operator+(const ModInt &rhs) const {
        return ModInt(*this) += rhs;
    }
    constexpr ModInt operator-(const ModInt &rhs) const {
        return ModInt(*this) -= rhs;
    }
    constexpr ModInt operator*(const ModInt &rhs) const {
        return ModInt(*this) *= rhs;
    }
    constexpr ModInt operator/(const ModInt &rhs) const {
        return ModInt(*this) /= rhs;
    }
    constexpr ModInt &operator+=(const ModInt &rhs) {
        val += rhs.val;
        if(val >= MOD) {
            val -= MOD;
        }
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt &rhs) {
        if(val < rhs.val) {
            val += MOD;
        }
        val -= rhs.val;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt &rhs) {
        val = val * rhs.val % MOD;
        return *this;
    }

    constexpr ModInt &operator/=(const ModInt &rhs) {
        *this *= rhs.inv();
        return *this;
    }

    constexpr bool operator==(const ModInt &rhs) {
        return this->val == rhs.val;
    }
    constexpr bool operator!=(const ModInt &rhs) {
        return this->val != rhs.val;
    }
    friend constexpr ostream &operator<<(ostream &os, const ModInt<MOD> &x) {
        return os << x.val;
    }
    friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) {
        return is >> x.val;
    }

    constexpr ModInt inv() const { return ModInt(*this).pow(MOD - 2); }

    constexpr ModInt pow(ll e) const {
        u64 x = 1, p = val;
        while(e > 0) {
            if(e % 2 == 0) {
                p = (p * p) % MOD;
                e /= 2;
            } else {
                x = (x * p) % MOD;
                e--;
            }
        }
        return ModInt(x);
    }
};

using mint = ModInt<MOD>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    INT(n, m, t);
    Matrix<bool> mat(n, n);
    rep(i, m) {
        INT(a, b);
        mat[b][a] = 1;
    }
    Matrix<bool> vec(n, 1);
    vec[0][0] = 1;
    auto res = (mat ^ t) * vec;
    int ans = 0;
    rep(i, n) if(res[i][0]) ans++;
    cout << ans << endl;
}
0