結果
問題 | No.1340 おーじ君をさがせ |
ユーザー |
![]() |
提出日時 | 2021-01-15 21:34:50 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 322 ms / 2,000 ms |
コード長 | 6,653 bytes |
コンパイル時間 | 16,067 ms |
コンパイル使用メモリ | 286,000 KB |
最終ジャッジ日時 | 2025-01-17 18:41:40 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 59 |
ソースコード
#line 2 "cpplib/util/template.hpp"#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC target("avx2")#include<bits/stdc++.h>using namespace std;struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;typedef long long lint;#define INF (1LL<<60)#define IINF (1<<30)#define EPS (1e-10)#define endl ('\n')typedef vector<lint> vec;typedef vector<vector<lint>> mat;typedef vector<vector<vector<lint>>> mat3;typedef vector<string> svec;typedef vector<vector<string>> smat;template<typename T>using V=vector<T>;template<typename T>using VV=V<V<T>>;template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}template<typename T>inline void output2(T t){for(auto i:t)output(i);}template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}template<typename T>inline void debug2(T t){for(auto i:t)output(i);}#define loop(n) for(long long _=0;_<(long long)(n);++_)#define _overload4(_1,_2,_3,_4,name,...) name#define __rep(i,a) repi(i,0,a,1)#define _rep(i,a,b) repi(i,a,b,1)#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)#define _overload3_rev(_1,_2,_3,name,...) name#define _rep_rev(i,a) repi_rev(i,0,a)#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)// #define rep(i,...) for(auto i:range(__VA_ARGS__))// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)// #define irep(i) for(lint i=0;;++i)// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}#define all(n) begin(n),end(n)template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}const vector<lint> dx={1,0,-1,0,1,1,-1,-1};const vector<lint> dy={0,1,0,-1,1,-1,1,-1};#define SUM(v) accumulate(all(v),0LL)template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else returnvector(arg,make_vector<T>(x,args...));}#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))#define bit(n,a) ((n>>a)&1)vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}using graph=vector<vector<int>>;template<typename T>using graph_w=vector<vector<pair<int,T>>>;template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}#line 3 "cpplib/alga/maybe.hpp"/*** @brief Maybe* @see https://ja.wikipedia.org/wiki/%E3%83%A2%E3%83%8A%E3%83%89_(%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0)#Maybe%E3%83%A2%E3%83%8A%E3%83%89*/template<typename T>struct maybe{bool _is_none;T val;maybe():_is_none(true){}maybe(T val):_is_none(false),val(val){}T unwrap()const{assert(!_is_none);return val;}T unwrap_or(T e)const{return _is_none?e:val;}bool is_none()const{return _is_none;}bool is_some()const{return !_is_none;}};template<typename T,typename F>auto expand(F op){return [&op](const maybe<T>& s,const maybe<T>& t){if(s.is_none())return t;if(t.is_none())return s;return maybe<T>(op(s.unwrap(),t.unwrap()));};}#line 4 "cpplib/segment_tree/segment_tree.hpp"/*** @brief セグメント木* @see https://en.wikipedia.org/wiki/Segment_tree*/template<typename T,typename F>class segment_tree{maybe<T>* node;F op;int n=1;public:segment_tree(){}segment_tree(int sz,F op=F()):op(op){while(n<=sz)n<<=1;node=new maybe<T>[n*2];for(int i=0;i<n*2;i++)node[i]=maybe<T>();}segment_tree(const std::vector<T>&v,F op=F()):op(op){auto f=expand<T,F>(op);const int sz=v.size();while(n<=sz)n<<=1;node=new maybe<T>[n*2]();for(int i=0;i<sz;i++)node[i+n]=maybe<T>(v[i]);for(int i=n-1;i>=1;i--)node[i]=f(node[i*2],node[i*2+1]);}maybe<T> get(int l,int r){auto f=expand<T,F>(op);l+=n;r+=n;maybe<T> s,t;while(l<r){if(l&1)s=f(s,node[l++]);if(r&1)t=f(node[--r],t);l>>=1;r>>=1;}return f(s,t);}void apply(int t,T _val){auto f=expand<T,F>(op);t+=n;maybe<T> val=maybe<T>(_val);while(t){node[t]=f(node[t],val);t=t>>1;}}void apply_left(int t,T _val){auto f=expand<T,F>(op);t+=n;maybe<T> val=maybe<T>(_val);while(t){node[t]=f(val,node[t]);t=t>>1;}}void change(int t,T val){auto f=expand<T,F>(op);t+=n;node[t]=maybe<T>(val);while(t>1){t=t>>1;node[t]=f(node[t*2],node[t*2+1]);}}};#line 3 "code.cpp"int main(){lint n,m,t;cin>>n>>m>>t;mat ans(n,vec(n,0));mat v(n,vec(n,0));ans[0][0]=1;rep(i,m){lint s,t;cin>>s>>t;v[s][t]=1;}auto mul=[&](const mat& s,const mat& t){mat res(n,vec(n,0));rep(i,n)rep(j,n)rep(k,n){res[i][k]|=s[i][j]&t[j][k];}return res;};while(t){if(t%2)ans=mul(ans,v);v=mul(v,v);t/=2;}lint ans2=0;rep(i,n){ans2+=ans[0][i];}cout<<ans2<<endl;}