結果

問題 No.1750 ラムドスウイルスの感染拡大-hard
コンテスト
ユーザー siro53
提出日時 2023-02-22 18:50:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 205 ms / 2,000 ms
コード長 7,201 bytes
コンパイル時間 2,302 ms
コンパイル使用メモリ 201,908 KB
最終ジャッジ日時 2025-02-10 19:55:07
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "yuki1750.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/1750"
#line 1 "/Users/siro53/kyo-pro/compro_library/template/template.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define REVERSE(v) reverse(ALL(v))
#define SZ(v) ((int)(v).size())
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros
#line 2 "/Users/siro53/kyo-pro/compro_library/modint/modint.hpp"

#line 6 "/Users/siro53/kyo-pro/compro_library/modint/modint.hpp"

template <int mod> class ModInt {
  public:
    ModInt() : x(0) {}
    ModInt(long long y)
        : x(y >= 0 ? y % umod() : (umod() - (-y) % umod()) % umod()) {}
    unsigned int val() const { return x; }
    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= umod()) x -= umod();
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += umod() - p.x) >= umod()) x -= umod();
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (unsigned int)(1ULL * x * p.x % umod());
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inv();
        return *this;
    }
    ModInt operator-() const { return ModInt(-(long long)x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inv() const {
        long long a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            std::swap(a -= t * b, b);
            std::swap(u -= t * v, v);
        }
        return ModInt(u);
    }
    ModInt pow(unsigned long long n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
    friend std::ostream &operator<<(std::ostream &os, const ModInt &p) {
        return os << p.x;
    }
    friend std::istream &operator>>(std::istream &is, ModInt &a) {
        long long t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }
    static constexpr int get_mod() { return mod; }

  private:
    unsigned int x;
    static constexpr unsigned int umod() { return mod; }
};
#line 2 "/Users/siro53/kyo-pro/compro_library/math/matrix.hpp"

#line 6 "/Users/siro53/kyo-pro/compro_library/math/matrix.hpp"

template <typename T> class Matrix {
  public:
    Matrix() {}
    explicit Matrix(int n) : Matrix(n, n) {}
    explicit Matrix(int n, int m) : dat(n, std::vector<T>(m)) {}
    size_t height() const { return dat.size(); }
    size_t width() const { return dat[0].size(); }
    const std::vector<T> &operator[](int k) const { return dat[k]; }
    std::vector<T> &operator[](int k) { return dat[k]; }
    static inline Matrix I(int n) {
        Matrix ret(n);
        for(int i = 0; i < n; i++) ret[i][i] = T(1);
        return ret;
    }
    Matrix &operator+=(const Matrix &other) {
        size_t n = height(), m = width();
        assert(n == other.height() && m == other.width());
        for(size_t i = 0; i < n; i++) {
            for(size_t j = 0; j < m; j++) { (*this)[i][j] += other[i][j]; }
        }
        return (*this);
    }
    Matrix &operator-=(const Matrix &other) {
        size_t n = height(), m = width();
        assert(n == other.height() && m == other.width());
        for(size_t i = 0; i < n; i++) {
            for(size_t j = 0; j < m; j++) { (*this)[i][j] -= other[i][j]; }
        }
        return (*this);
    }
    Matrix &operator*=(const Matrix &other) {
        size_t n = height(), m2 = width();
        size_t m = other.width();
        assert(m2 == other.height());
        std::vector res(n, std::vector<T>(m));
        for(size_t i = 0; i < n; i++) {
            for(size_t j = 0; j < m; j++) {
                T sum = 0;
                for(size_t k = 0; k < m2; k++) {
                    sum += (*this)[i][k] * other[k][j];
                }
                res[i][j] = sum;
            }
        }
        this->dat.swap(res);
        return (*this);
    }
    Matrix operator+(const Matrix &other) const {
        return (Matrix(*this) += other);
    }
    Matrix operator-(const Matrix &other) const {
        return (Matrix(*this) -= other);
    }
    Matrix operator*(const Matrix &other) const {
        return (Matrix(*this) *= other);
    }
    Matrix pow(long long k) const {
        Matrix res = Matrix::I(height()), mul = (*this);
        while(k > 0) {
            if(k & 1) res *= mul;
            mul *= mul;
            k >>= 1;
        }
        return res;
    }

  private:
    std::vector<std::vector<T>> dat;
};
#line 5 "yuki1750.test.cpp"

using mint = ModInt<MOD2>;
using matrix = Matrix<mint>;

int main() {
    int N, M;
    ll T;
    cin >> N >> M >> T;
    matrix G(N);
    REP(_, M) {
        int a, b;
        cin >> a >> b;
        G[a][b] = G[b][a] = 1;
    }
    matrix init(N, 1);
    init[0][0] = mint(1);
    auto res = G.pow(T) * init;
    cout << res[0][0] << endl;
}
0