• branch=trunk inherited from [9165bd3629]
• sym-trunk inherited from [9165bd3629]

Modified lib/typical/unionfind.cpp from [12244591e3a7308e] to [c818f654949cbd86].

   15                  { for(int i=0; i<N; ++i) uf[i] = i; }                                 15                  { for(int i=0; i<N; ++i) uf[i] = i; }
   16          int size()                                                                    16          int size()
   17                  { return nc; }                                                        17                  { return nc; }
   18          int size(int a)                                                               18          int size(int a)
   19                  { return sz[Find(a)]; }                                               19                  { return sz[Find(a)]; }
   20          int Find(int a)                                                               20          int Find(int a)
   21                  { return uf[a]==a ? a : uf[a]=Find(uf[a]); }                          21                  { return uf[a]==a ? a : uf[a]=Find(uf[a]); }
                                                                                        >    22                  // Semi-compression w.o. recursion.
                                                                                        >    23                  //{ while(uf[a] != a) a=uf[a]=uf[uf[a]]; return a; }
   22          bool Union(int a, int b)                                                      24          bool Union(int a, int b)
   23                  {                                                                     25                  {
   24                          a = Find(a);                                                  26                          a = Find(a);
   25                          b = Find(b);                                                  27                          b = Find(b);
   26                          if( a != b )                                                  28                          if( a != b )
   27                          {                                                             29                          {
   28                                  if( sz[a] >= sz[b] ) swap(a, b);                      30                                  if( sz[a] >= sz[b] ) swap(a, b);