結果
問題 | No.1750 ラムドスウイルスの感染拡大-hard |
ユーザー |
![]() |
提出日時 | 2021-11-19 22:28:44 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 349 ms / 2,000 ms |
コード長 | 1,992 bytes |
コンパイル時間 | 1,629 ms |
コンパイル使用メモリ | 167,868 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2025-01-01 19:18:56 |
合計ジャッジ時間 | 6,468 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using V = vector<ll>;using VV = vector<V>;using VVV = vector<VV>;using VVVV = vector<VVV>;using VVVVV = vector<VVVV>;using VVVVVV = vector<VVVVV>;using VS = vector<string>;using VB = vector<bool>;using VVB = vector<VB>;using P = pair<ll,ll>;using M = map<ll,ll>;using Q = queue<ll>;using PQ = priority_queue<ll>;using PQG = priority_queue<ll,V,greater<ll>>;using S = set<ll>;using VP = vector<P>;const ll MOD = 1000000007;const ll mod = 998244353;const ll INF = 1LL << 60;#define rep(i,n) for(ll i = 0; i < n; i++)#define rep2(i,s,n) for(ll i = s; i < n; i++)#define per(i,n) for(ll i = n-1; i >= 0; i--)#define per2(i,s,n) for(ll i = n-1; i >= s; i--)#define all(x) (x).begin(),(x).end()#define rall(x) (x).rbegin(),(x).rend()#define fi first#define se second#define pb push_back#define pf push_front#define ppb pop_back#define ppf pop_front#define eb emplace_back#define lb lower_bound#define ub upper_boundtemplate<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}template<class T>void Vin(vector<T>&a){rep(i,(int)a.size())cin>>a[i];}template<class T>void VVin(vector<vector<T>>&a){rep(i,(ll)a.size())Vin(a[i]);}template<class T>void Vout(const vector<T>&a){rep(i,(int)a.size())cout<<a[i]<<endl;}ll power(ll a,ll b,const ll&M){a%=M;ll res=1;while(b>0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;}const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};VV f(VV a, VV b) {ll x = a.size();VV res(x,V(x));rep(i,x) rep(j,x) rep(k,x) res[i][j] = (res[i][j]+a[i][k]*b[k][j])%mod;return res;}int main() {ll n, m, T;cin >> n >> m >> T;VV G(n,V(n));rep(i,m) {ll s, t;cin >> s >> t;G[s][t] = G[t][s] = 1;}T--;VV ans = G;while(T > 0) {if(T&1) ans = f(ans,G);G = f(G,G);T >>= 1;}cout << ans[0][0] << endl;}