POJ 1861 Network

It is also a minimal spanning tree problem.

Special Judge. The answer is not unique. So the sample looks wrong...

It is also a sad G ++ AC. Submit C ++ and then WA...

We have to go over the road and look at it.

# Include
 
  
# Include
  
   
# Include
   
    
# Include
    
     
# Include
     # Include
      
        # Include
       
         # Include
        
          # Include
         
           # Include
          
            # Define INF 0x7fffffff # define eps 1e-6using namespace std; int n, m; struct lx {int u, v, len; bool vis;} l [500*1001]; int fa [1001]; bool cmp (lx a, lx B) {return. len
           
            

            
Changed the sorting method.
            
Then G ++ still AC.
            
C ++ becomes RE.
            


            

            
#include
             
              #include
              
               #include
               
                #include#include
                
                 #include
                 #include
                  
                   #include
                   
                    #include
                    
                     #include
                     
                      #include
                      
                       #define INF 0x7fffffff#define eps 1e-6using namespace std;int n,m;struct lx{ int u,v,len;} l[500*1001];int fa[1001];bool cmp(const lx &a,const lx &b){ return a.len
                       
                        q; for(int i=0;i