排位赛2-Fence Planning

题目

Farmer John’s N cows, conveniently numbered 1…N (2≤N≤105), have a complex social structure revolving around “moo networks” — smaller groups of cows that communicate within their group but not with other groups. Each cow is situated at a distinct (x,y) location on the 2D map of the farm, and we know that M pairs of cows (1≤M<105) moo at each-other. Two cows that moo at each-other belong to the same moo network.

In an effort to update his farm, Farmer John wants to build a rectangular fence, with its edges parallel to the x and y axes. Farmer John wants to make sure that at least one moo network is completely enclosed by the fence (cows on the boundary of the rectangle count as being enclosed). Please help Farmer John determine the smallest possible perimeter of a fence that satisfies this requirement. It is possible for this fence to have zero width or zero height.

题意

在二维网格上有n头牛，他们之间有n对关系，现在需要建造栅栏，建造得栅栏一定要把有联系的牛都围起来，求最小面积的栅栏面积是多少。

解法

先用并查集将所有牛分好类，然后直接求每一个关系圈的牛所需要的栅栏面积即可。

代码：

#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
const int maxn=200010;
int n,m,xx,yy,ans,father[maxn],max_x[maxn],min_x[maxn],max_y[maxn],min_y[maxn],x[maxn],y[maxn];int getfather(int x)
{if (father[x]!=x) father[x]=getfather(father[x]);return father[x];
}int main()
{scanf("%d%d",&n,&m);for (int i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);for (int i=1;i<=n;i++) {father[i]=i;max_x[i]=-1;min_x[i]=100000010;max_y[i]=-1;min_y[i]=100000010;}for (int i=1;i<=m;i++) {scanf("%d%d",&xx,&yy);int fax=getfather(xx);int fay=getfather(yy);if (fax==fay) continue;father[fax]=fay;}for (int i=1;i<=n;i++) {father[i]=getfather(father[i]);int fa=father[i];max_x[fa]=max(max_x[fa],x[i]);min_x[fa]=min(min_x[fa],x[i]);max_y[fa]=max(max_y[fa],y[i]);min_y[fa]=min(min_y[fa],y[i]);}ans=-1;for (int i=1;i<=n;i++) if (father[i]==i) {if (ans==-1) ans=(max_x[i]-min_x[i]+max_y[i]-min_y[i])*2; else ans=min(ans,(max_x[i]-min_x[i]+max_y[i]-min_y[i])*2);}printf("%d",ans);return 0;
}

排位赛2-Fence Planning相关推荐

2020 GDUT Rating Contest II (Div. 2) A. Fence Planning
来源 codeforces 2020 GDUT Rating Contest II (Div. 2) CF链接题目: Farmer John's N cows, conveniently numbe ...
GDUT_排位赛题解报告_第2场_Fence Planning
题目: A. Fence Planning time limit per test1 second memory limit per test256 megabytes inputstandard i ...
codeforces 排位赛2
传送门题面 A. Fence Planning time limit per test1 second memory limit per test256 megabytes inputstandar ...
APICS与AX的Master Planning(四)---Time Fence时限(时界)
对于一个计划系统来说,用一个个的时间点来划定不同的范围是必要的,因为不可能要求计划员去时时刻刻关注所有的订单,人的精力毕竟有限,圈定一个范围让计划员只关注某个时间点以内的有限的订单是比较合理的,这一篇 ...
【Planning】R3 PTF and firm mapped with APO
Purpose: 理清R3里的firm type,与APO里的SNP production horizon.ST horizon等的关系. Approach: MRP Type P1 - > C ...
MRP:时间栅栏(Time Fence)
一,定义时间栅栏是一个物料的属性.它将整个计划覆盖的日期(即从今天Today至计划期间Planning Horizontal)范围分成两段,分别为"时间栅栏内"(Inside t ...
Apollo Planning学习（9）-------速度规划
顺着之前学习public road planner 的路径规划中lane follow的task,在得到的规划路径上再进行速度规划.大致思路为先利用ST Graph,将障碍物.限速等投影在ST图上,利 ...
极限编程 (Extreme Programming) - 迭代计划 (Iterative Planning)
(Source: XP - Iteration Planning) 在每次迭代开始时调用迭代计划会议,以生成该迭代的编程任务计划.每次迭代为1到3周. 客户从发布计划中按照对客户最有价值的顺序选择用户 ...
ARP(Accounting Resource Planning)项目感想
ARP是Accounting Resource Planning(会计资源计划)的简称. 转载于:https://blog.51cto.com/lya041/690079

排位赛2-Fence Planning

排位赛2-Fence Planning

题目

题意

解法

代码：

排位赛2-Fence Planning相关推荐

最新文章

热门文章