2020 GDUT Rating Contest II (Div. 2) A - Fence Planning 题解

原题

题目大意

给出一些点和点之间的联系，求将一个网络完全圈起来所需的最小周长。

题目分析

一开始不太懂题目在讲什么，后来才看懂了……
这其实是一个并查集，合并的时候扩展一下坐标就行，最后输出周长最小的
ps：他说可能出现长为0或宽为0的情况，然而还是照着公式算就好……

代码

#include<cstdio>
#define min(a,b) (a < b ? a : b)
#define max(a,b) (a > b ? a : b)
#define peri(x,y) ((x + y) * 2)
 
int father[100011];
int ax[100011],ay[100011],zx[100011],zy[100011];
int find(int x)
{
    if (father[x] == x) return x;
    father[x] = find(father[x]);
    return father[x];
}
void merge(int a,int b)
{
    int afa = find(a),bfa = find(b);
    if (afa == bfa) return;
    father[bfa] = afa;
    ax[afa] = min(ax[afa],ax[bfa]),ay[afa] = min(ay[afa],ay[bfa]);
    zx[afa] = max(zx[afa],zx[bfa]),zy[afa] = max(zy[afa],zy[bfa]);
}
int main()
{
    int n,k,ans = 0x7f7f7f7f;
    scanf("%d%d",&n,&k);
    for (int i = 1;i <= n;++i) father[i] = i;
    for (int i = 1;i <= n;++i)
    {
        scanf("%d%d",ax + i,ay + i);
        zx[i] = ax[i],zy[i] = ay[i];
    }
    for (int i = 1;i <= k;++i)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        merge(a,b);
    }
    for (int i = 1;i <= n;++i)
    {
        int t = find(i);
        ans = min(ans,peri(zx[t] - ax[t],zy[t] - ay[t]));
    }
    printf("%d",ans);
    return 0;
}