Submit Info #11389

Problem Lang User Status Time Memory
Dominator Tree cpp hotman AC 91 ms 25.92 MiB

ケース詳細
Name Status Time Memory
example_00 AC 2 ms 0.71 MiB
example_01 AC 2 ms 0.67 MiB
random_00 AC 32 ms 18.17 MiB
random_01 AC 91 ms 25.92 MiB
random_02 AC 23 ms 8.92 MiB
random_03 AC 38 ms 23.71 MiB
random_04 AC 5 ms 2.66 MiB

#pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC push_options #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx") #include<bits/stdc++.h> #include <xmmintrin.h> #include <immintrin.h> using namespace::std; __attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);} #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/priority_queue.hpp> #include<ext/pb_ds/tag_and_trait.hpp> // #include <boost/multiprecision/cpp_dec_float.hpp> // #include <boost/multiprecision/cpp_int.hpp> // namespace mp = boost::multiprecision; // typedef mp::number<mp::cpp_dec_float<0>> cdouble; // typedef mp::cpp_int cint; template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>; template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>; template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>; template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>; typedef long long lint; #define INF (1LL<<60) #define IINF (1<<30) #define LINF (9223372036854775807LL) #define EPS (1e-10) #define endl ('\n') #define MOD 1000000007LL //#define MOD 998244353LL 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>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;} template<typename T>inline void numout2(T t){for(auto i:t)numout(i);} 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 _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;} template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);} template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;} #define rep(i,n) for(lint i=0;i<lint(n);++i) #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i) #define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i) #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i) #define irep(i) for(lint i=0;;++i) #define all(n) begin(n),end(n) #define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2)) inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;} inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;} // inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;} // inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;} bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;} bool chmax(auto& s,const auto& t){bool res=s<t;s=max(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) auto call=[](auto f,auto... args){return f(f,args...);}; struct uf_min{ constexpr static int inf=1<<30; vector<int>par,mn,mnid; uf_min(int v){ par.resize(v); mn.resize(v,inf); mnid.resize(v); iota(par.begin(),par.end(),0); iota(mnid.begin(),mnid.end(),0); } int find(int v){ if(par[v]==v)return v; int r=find(par[v]); if(mn[v]>mn[par[v]]){ mnid[v]=mnid[par[v]]; mn[v]=mn[par[v]]; } par[v]=r; return r; } void set(int v,int x){ mn[v]=x; } int eval(int v){ find(v); return mnid[v]; } //xをyの親にする void link(int x,int y){ par[y]=x; } }; int main(){ lint n,m,s; cin>>n>>m>>s; vector<vector<int>> g(n); vector<vector<int>> rev_g(n); rep(i,m){ lint s,t; cin>>s>>t; g[s].push_back(t); rev_g[t].push_back(s); } stack<int>stk; vector<bool>used(n,0); vector<int>id(n+1,n); vector<int>id2(n+1,n); vector<int>sdom(n,n); vector<int>idom(n,n); vector<vector<int>>ch(n); sdom[s]=s; int idx=0; stk.emplace(s); while(!stk.empty()){ auto v=stk.top(); stk.pop(); id2[v]=idx; id[idx++]=v; for(auto e:g[v]){ if(!used[e]){ ch[v].push_back(e); stk.emplace(e); used[e]=1; } } } for(int i=0;i<n;++i){ int v=id[i]; if(v==n)continue; if(v==s)continue; for(auto e:rev_g[v]){ if(id2[e]<i){ if(id2[sdom[v]]>id2[e]){ sdom[v]=e; } } } } uf_min uf(n); vector<vector<int>>sdom_list(n+1); vector<int>u(n,-1); for(int i=n-1;i>=0;--i){ int v=id[i]; if(v==n)continue; for(auto e:sdom_list[v]){ u[e]=uf.eval(e); } if(v==s)continue; for(auto e:rev_g[v]){ if(id2[e]<i)continue; auto d=uf.eval(e); if(id2[sdom[v]]>id2[sdom[d]])sdom[v]=sdom[d]; } sdom_list[sdom[v]].push_back(v); uf.set(v,id2[sdom[v]]); for(auto e:ch[v]){ uf.link(v,e); } } for(int i=0;i<n;++i){ auto v=id[i]; if(v==n)continue; if(v==s){ idom[v]=v; continue; } if(sdom[v]==sdom[u[v]])idom[v]=sdom[v]; else idom[v]=idom[u[v]]; } for(int i=0;i<n;++i)if(idom[i]==n)idom[i]=-1; output(idom); }