UVA 12167 Proving Equivalences 强连通分量-白红宇

UVA 12167 Proving Equivalences 强连通分量

阅读量：6902 次

发布时间：2019-06-27

本文共 1183 字，大约阅读时间需要 3 分钟。

//#pragma comment(linker, "/STACK:1024000000,1024000000")#include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #include
              
               #include
               #include
                
                 #include
                 
                  #include
                  
                   #include
                   
                    using namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair
                    
                      pii;#define pb(a) push(a)#define INF 0x1f1f1f1f#define lson idx<<1,l,mid#define rson idx<<1|1,mid+1,r#define PI 3.1415926535898template
                     
                       T min(const T& a,const T& b,const T& c) { return min(min(a,b),min(a,c));}template
                      
                        T max(const T& a,const T& b,const T& c) { return max(max(a,b),max(a,c));}void debug() {#ifdef ONLINE_JUDGE#else freopen("d:\\in1.txt","r",stdin); freopen("d:\\out1.txt","w",stdout);#endif}int getch() { int ch; while((ch=getchar())!=EOF) { if(ch!=' '&&ch!='\n')return ch; } return EOF;}struct Edge{ int u,v;};const int maxn=20005;int pre[maxn],lowlink[maxn],sccno[maxn];int dfs_clock,scc_cnt;vector
                       
                         g[maxn],scc[maxn];stack
                        
                          s;void dfs(int u,int fa){ lowlink[u]=pre[u]=++dfs_clock; s.push(u); for(int i=0;i