結果
問題 | No.1749 ラムドスウイルスの感染拡大 |
ユーザー |
![]() |
提出日時 | 2021-11-19 22:29:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 7 ms / 2,000 ms |
コード長 | 13,333 bytes |
コンパイル時間 | 1,588 ms |
コンパイル使用メモリ | 141,772 KB |
最終ジャッジ日時 | 2025-01-25 20:33:34 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 26 |
ソースコード
/* #region Head */// #include <bits/stdc++.h>#include <algorithm>#include <array>#include <bitset>#include <cassert> // assert.h#include <cmath> // math.h#include <cstring>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <list>#include <map>#include <memory>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll, ll>;template <class T> using vc = vector<T>;template <class T> using vvc = vc<vc<T>>;using vll = vc<ll>;using vvll = vvc<ll>;using vld = vc<ld>;using vvld = vvc<ld>;using vs = vc<string>;using vvs = vvc<string>;template <class T, class U> using um = unordered_map<T, U>;template <class T> using pq = priority_queue<T>;template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;template <class T> using us = unordered_set<T>;#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)#define ALL(x) begin(x), end(x)#define SIZE(x) ((ll)(x).size())#define ISIZE(x) ((int)(x).size())#define PERM(c) \sort(ALL(c)); \for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))#define UNIQ(v) v.erase(unique(ALL(v)), v.end());#define CEIL(a, b) (((a) + (b)-1) / (b))#define endl '\n'constexpr ll INF = 1'010'000'000'000'000'017LL;constexpr int IINF = 1'000'000'007LL;// constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7constexpr ll MOD = 998244353;constexpr ld EPS = 1e-12;constexpr ld PI = 3.14159265358979323846;template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力for (T &x : vec) is >> x;return is;}template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)os << "{";REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");return os;}template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力REP(i, 0, SIZE(arr)) is >> arr[i];return is;}template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)os << "{";REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力is >> pair_var.first >> pair_var.second;return is;}template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}// map, um, set, us 出力template <class T> ostream &out_iter(ostream &os, const T &map_var) {os << "{";REPI(itr, map_var) {os << *itr;auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}return os << "}";}template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {return out_iter(os, map_var);}template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {os << "{";REPI(itr, map_var) {auto [key, value] = *itr;os << "(" << key << ", " << value << ")";auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}os << "}";return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {pq<T> pq_cp(pq_var);os << "{";if (!pq_cp.empty()) {os << pq_cp.top(), pq_cp.pop();while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();}return os << "}";}// tuple 出力template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {if constexpr (N < std::tuple_size_v<tuple<Args...>>) {os << get<N>(a);if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {os << ' ';} else if constexpr (end_line) {os << '\n';}return operator<<<N + 1, end_line>(os, a);}return os;}template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<<<0, true>(cout, a); }void pprint() { cout << endl; }template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {cout << head;if (sizeof...(Tail) > 0) cout << ' ';pprint(move(tail)...);}// dump#define DUMPOUT cerrvoid dump_func() { DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {DUMPOUT << head;if (sizeof...(Tail) > 0) DUMPOUT << ", ";dump_func(move(tail)...);}// chmax (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {if (comp(xmax, x)) {xmax = x;return true;}return false;}// chmin (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {if (comp(x, xmin)) {xmin = x;return true;}return false;}// ローカル用#ifndef ONLINE_JUDGE#define DEBUG_#endif#ifdef DEBUG_#define DEB#define dump(...) \DUMPOUT << " " << string(#__VA_ARGS__) << ": " \<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \<< " ", \dump_func(__VA_ARGS__)#else#define DEB if (false)#define dump(...)#endif#define VAR(type, ...) \type __VA_ARGS__; \cin >> __VA_ARGS__;template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }struct AtCoderInitialize {static constexpr int IOS_PREC = 15;static constexpr bool AUTOFLUSH = false;AtCoderInitialize() {ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);cout << fixed << setprecision(IOS_PREC);if (AUTOFLUSH) cout << unitbuf;}} ATCODER_INITIALIZE;void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }/* #endregion */// #include <atcoder/all>// using namespace atcoder;/* #region mint */// 自動で MOD を取る整数struct mint {ll x;mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}mint &operator+=(const mint &a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint &operator-=(const mint &a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint &a) {(x *= a.x) %= MOD;return *this;}mint operator+(const mint &a) const {mint res(*this);return res += a;}mint operator-(const mint &a) const {mint res(*this);return res -= a;}mint operator*(const mint &a) const {mint res(*this);return res *= a;}// O(log(t))mint pow_rec(ll t) const {if (!t) return 1;mint a = pow(t >> 1); // ⌊t/2⌋ 乗a *= a; // ⌊t/2⌋*2 乗if (t & 1) // ⌊t/2⌋*2 == t-1 のときa *= *this; // ⌊t/2⌋*2+1 乗 => t 乗return a;}mint pow(ll t) const {mint a(*this);mint res = 1;while (t) {if (t & 1) res *= a;t >>= 1, a *= a;}return res;}// for prime modmint inv_prime() const {return pow(MOD - 2); // オイラーの定理から, x^(-1) ≡ x^(p-2)}mint inv() const {ll a = this->x, b = MOD, u = 1, v = 0, t;mint res;while (b) {t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}if (u < 0) u += MOD;res = u;return res;}mint &operator/=(const mint &a) { return (*this) *= a.inv(); }mint operator/(const mint &a) const {mint res(*this);return res /= a;}bool operator==(const mint &a) const { return this->x == a.x; }bool operator==(const ll a) const { return this->x == a; }bool operator!=(const mint &a) const { return this->x != a.x; }bool operator!=(const ll a) const { return this->x != a; }// mint 入力friend istream &operator>>(istream &is, mint &x) {is >> x.x;return is;}// mint 出力friend ostream &operator<<(ostream &os, const mint x) {os << x.x;return os;}};/* #endregion *//* #region Graph */// エッジ(本来エッジは双方向だが,ここでは単方向で管理)template <class weight_t = int, class flow_t = int> struct Edge {int src; // エッジ始点となる頂点int dst; // エッジ終点となる頂点weight_t weight; // 重みflow_t cap;Edge() : src(0), dst(0), weight(0) {}Edge(int src, int dst, weight_t weight) : src(src), dst(dst), weight(weight) {}Edge(int src, int dst, weight_t weight, flow_t cap) : src(src), dst(dst), weight(weight), cap(cap) {}// Edge 標準出力friend ostream &operator<<(ostream &os, Edge &edge) {os << "(" << edge.src << " -> " << edge.dst << ", " << edge.weight << ")";return os;}};// 同じ頂点を始点とするエッジ集合template <class weight_t = int, class flow_t = int> class Node : public vc<Edge<weight_t, flow_t>> {public:int idx;Node() : vc<Edge<weight_t, flow_t>>() {}// void add(int a, int b, weight_t w, flow_t cap) { this->emplace_back(a, b, w, cap); };};// graph[i] := 頂点 i を始点とするエッジ集合template <class weight_t = int, class flow_t = int> class Graph : public vc<Node<weight_t, flow_t>> {public:Graph() : vc<Node<weight_t, flow_t>>() {}Graph(int n) : vc<Node<weight_t, flow_t>>(n) { REP(i, 0, n)(*this)[i].idx = i; }/** 単方向 */void add_arc(int a, int b, weight_t w = 1, flow_t cap = 1) { (*this)[a].emplace_back(a, b, w, cap); }/** 双方向 */void add_edge(int a, int b, weight_t w = 1, flow_t cap = 1) { add_arc(a, b, w, cap), add_arc(b, a, w, cap); }/** ノード追加 */int add_node() {int idx = (int)this->size();this->emplace_back();Node<weight_t, flow_t> &node = this->back();node.idx = idx;return idx;}};// using Array = vc<Weight>;// using Matrix = vc<Array>;/* #endregion */// Problemvoid solve() {VAR(ll, n, m, T);vll s(m), t(m);REP(i, 0, m) cin >> s[i], t[i];Graph<> g(n);REP(i, 0, m) g.add_edge(s[i], t[i]);vc<mint> dp(n, 0);dp[0] = 1;REP(day, 0, T) {vc<mint> dp2(n, 0); //REP(i, 0, n) {for (const auto &e : g[i]) {dp2[e.dst] += dp[e.src];}}dp = dp2;}pprint(dp[0]);}// entry pointint main() {solve();return 0;}