2020.2.22 排位赛 Fence Planning（并查集）

Fence Planning

题面

题目分析
基础并查集，做题并查集刚学加上好久没用忘了这玩意，头铁写了个思想类似并查集的东西，又臭又长
代码

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cmath>
#include<iostream>

using namespace std;

int Minn[100002][5];
int cnet[100002],cnt=0;//cnet存根，cnt存树的数量

struct Used
{
 int u,num;
}used[100002];//u记录一个点是否被用过，num记录属于哪个根

int main()
{
 int N,M;
 scanf("%d%d",&N,&M);
 
 for(int i=1;i<=N;i++)
 {
  int x,y;
  scanf("%d%d",&x,&y);
  Minn[i][0]=x;Minn[i][1]=x;
  Minn[i][2]=y;Minn[i][3]=y;
 }
 
 for(int i=1;i<=M;i++)
 {
  int a,b;
  scanf("%d%d",&a,&b);
  if(used[a].u!=0||used[b].u!=0)
  {
   if(used[a].u!=0){
    a=cnet[ used[a].num ];
   }
   if(used[b].u!=0){
    b=cnet[ used[b].num ];
   }
   //update Minn[a] and Minn[b] 
   Minn[a][0]=min(Minn[a][0],Minn[b][0]);
   Minn[b][0]=min(Minn[a][0],Minn[b][0]);
   
   Minn[a][1]=max(Minn[a][1],Minn[b][1]);
   Minn[b][1]=max(Minn[a][1],Minn[b][1]);
   
   Minn[a][2]=max(Minn[a][2],Minn[b][2]);
   Minn[b][2]=max(Minn[a][2],Minn[b][2]);
   
   Minn[a][3]=min(Minn[a][3],Minn[b][3]);
   Minn[b][3]=min(Minn[a][3],Minn[b][3]);
   
   if(used[a].u!=0&&used[b].u!=0){
    cnet[used[b].num]=a;
   }else{
   
    if(used[a].u!=0){
     cnet[used[a].num]=a;
     used[b].u=1;
     used[b].num=a;
    }
    if(used[b].u!=0){
     cnet[used[b].num]=b;
     used[a].u=1;
     used[a].num=b;
    }
   }
  }else{
   
   used[a].u=1;used[b].u=1;
   used[a].num=cnt;used[b].num=cnt;
   cnet[used[a].num]=a;cnt++;
   //update Minn[a] and Minn[b] 
   Minn[a][0]=min(Minn[a][0],Minn[b][0]);
   Minn[b][0]=min(Minn[a][0],Minn[b][0]);
   
   Minn[a][1]=max(Minn[a][1],Minn[b][1]);
   Minn[b][1]=max(Minn[a][1],Minn[b][1]);
   
   Minn[a][2]=max(Minn[a][2],Minn[b][2]);
   Minn[b][2]=max(Minn[a][2],Minn[b][2]);
   
   Minn[a][3]=min(Minn[a][3],Minn[b][3]);
   Minn[b][3]=min(Minn[a][3],Minn[b][3]);
  }
 }
 int res=Minn[ cnet[0] ][1]-Minn[ cnet[0] ][0]+Minn[ cnet[0] ][2]-Minn[cnet[0]][3];
 for(int j=1;j<cnt;j++)
 {
  int I=cnet[j];
  res=min(res , Minn[I][1]-Minn[I][0]+Minn[I][2]-Minn[I][3]);
 }
 printf("%d",res*2);
 return 0; 
}