洛谷——P2872 [USACO07DEC]道路建设Building Roads
2024-09-08 01:24:13
P2872 [USACO07DEC]道路建设Building Roads
题目描述
Farmer John had just acquired several new farms! He wants to connect the farms with roads so that he can travel from any farm to any other farm via a sequence of roads; roads already connect some of the farms.
Each of the N (1 ≤ N ≤ 1,000) farms (conveniently numbered 1..N) is represented by a position (Xi, Yi) on the plane (0 ≤ Xi ≤ 1,000,000; 0 ≤ Yi ≤ 1,000,000). Given the preexisting M roads (1 ≤ M ≤ 1,000) as pairs of connected farms, help Farmer John determine the smallest length of additional roads he must build to connect all his farms.
给出nn个点的坐标,其中一些点已经连通,现在要把所有点连通,求修路的最小长度.
输入输出格式
输入格式:
Line 1: Two space-separated integers: N and M
Lines 2..N+1: Two space-separated integers: Xi and Yi
- Lines N+2..N+M+2: Two space-separated integers: i and j, indicating that there is already a road connecting the farm i and farm j.
输出格式:
- Line 1: Smallest length of additional roads required to connect all farms, printed without rounding to two decimal places. Be sure to calculate distances as 64-bit floating point numbers.
输入输出样例
输入样例#1:
4 1 1 1 3 1 2 3 4 3 1 4
输出样例#1:
4.00 最小生成树裸题
#include<cmath> #include<cstdio> #include<cstring> #include<cstdlib> #include<iostream> #include<algorithm> #define N 510000 using namespace std; int n,m,x,y,s,fx,fy,xx[N],yy[N],fa[N]; int read() { ,f=; char ch=getchar(); ; ch=getchar();} +ch-'; ch=getchar();} return x*f; } struct Edge { int x,y; double z; }edge[N<<]; int cmp(Edge a,Edge b) { return a.z<b.z; } int find(int x) { if(fa[x]==x) return x; fa[x]=find(fa[x]); return fa[x]; } int main() { n=read(),m=read(); ;i<=n;i++) xx[i]=read(),yy[i]=read(); ;i<=n;i++) ;j<=n;j++) if(i!=j) { ++s; edge[s].x=i; edge[s].y=j; edge[s].z=sqrt(pow(xx[i]-xx[j],)+pow(yy[i]-yy[j],)); } ;i<=n;i++) fa[i]=i; ; ;i<=m;i++) { x=read(),y=read(); fx=find(x),fy=find(y); fa[fx]=fy; } sort(edge+,edge++s,cmp); ;i<=s;i++) { x=edge[i].x,y=edge[i].y; fx=find(x),fy=find(y); if(fa[fx]==fy) continue; fa[fx]=fy; ans+=edge[i].z; } printf("%.2lf",ans); ; }
最新文章
- JS Date.parse() 函数详解
- MySQL之存储引擎MyISAM/InnoDB高并发优化经验
- exe文件添加为服务
- BLE-NRF51822教程19-Battery Service
- WPF让人哭笑不得的资源
- POJ 3616 Milking Time (字符串DP)
- .net 码农转战 iOS - 初探
- VC++/MFC操作ini配置文件详解
- WINFORM的DataGridView使用点滴
- Python:代码调试的好帮手sys._getframe()
- Ubuntu下载工具 uget+aria2
- 《JAVASCRIPT高级程序设计》window/location/navigator/screen/history对象
- UITextField成为第一响应者
- python时间模块datetime
- c#的一些快捷键
- apache利用http_referer进行防盗链
- [转载]FileStream读写文件
- MySQL应用架构优化-实时数据处理
- hdu 5781 ATM Mechine dp
- 87.在ModelSim中添加Xilinx ISE仿真库