POJ 2253 Frogger(最小生成树)
来源:互联网 发布:mac版搜狗输入法设置 编辑:程序博客网 时间:2024/06/05 16:09
题目链接:http://poj.org/problem?id=2253点击打开链接
Frogger
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 48449 Accepted: 15421
Description
Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen, he wants to avoid swimming and instead reach her by jumping.
Unfortunately Fiona's stone is out of his jump range. Therefore Freddy considers to use other stones as intermediate stops and reach her by a sequence of several small jumps.
To execute a given sequence of jumps, a frog's jump range obviously must be at least as long as the longest jump occuring in the sequence.
The frog distance (humans also call it minimax distance) between two stones therefore is defined as the minimum necessary jump range over all possible paths between the two stones.
You are given the coordinates of Freddy's stone, Fiona's stone and all other stones in the lake. Your job is to compute the frog distance between Freddy's and Fiona's stone.
Unfortunately Fiona's stone is out of his jump range. Therefore Freddy considers to use other stones as intermediate stops and reach her by a sequence of several small jumps.
To execute a given sequence of jumps, a frog's jump range obviously must be at least as long as the longest jump occuring in the sequence.
The frog distance (humans also call it minimax distance) between two stones therefore is defined as the minimum necessary jump range over all possible paths between the two stones.
You are given the coordinates of Freddy's stone, Fiona's stone and all other stones in the lake. Your job is to compute the frog distance between Freddy's and Fiona's stone.
Input
The input will contain one or more test cases. The first line of each test case will contain the number of stones n (2<=n<=200). The next n lines each contain two integers xi,yi (0 <= xi,yi <= 1000) representing the coordinates of stone #i. Stone #1 is Freddy's stone, stone #2 is Fiona's stone, the other n-2 stones are unoccupied. There's a blank line following each test case. Input is terminated by a value of zero (0) for n.
Output
For each test case, print a line saying "Scenario #x" and a line saying "Frog Distance = y" where x is replaced by the test case number (they are numbered from 1) and y is replaced by the appropriate real number, printed to three decimals. Put a blank line after each test case, even after the last one.
Sample Input
20 03 4317 419 418 50
Sample Output
Scenario #1Frog Distance = 5.000Scenario #2Frog Distance = 1.414
#include <iostream>#include <vector>#include <algorithm>#include <math.h>#include <stdio.h>using namespace std;struct xjy{ int x; int y;};struct edge{ double dis; int be; int eend; bool operator < (const edge &r)const { return dis<r.dis; }};vector < xjy > s;vector < edge> ss;int pre[222];int findx(int x){ int r=x; while(pre[r]!=r) { r=pre[r]; } int i=x;int j; while(pre[i]!=r) { j=pre[i]; pre[i]=r; i=j; } return r;}void join ( int x,int y){ int p1=findx(x); int p2=findx(y); if(p1!=p2) pre[p2]=p1;}int main(){ int n;int cnt=1; while(cin >> n,n) { for(int i=0;i<222;i++) pre[i]=i; s.clear(); ss.clear(); for(int i=0;i<n;i++) { xjy mid; cin >> mid.x >> mid.y; s.push_back(mid); } for(int i=0;i<s.size();i++) { for(int j=i+1;j<s.size();j++) { edge mid; mid.be=i; mid.eend=j; mid.dis=sqrt((s[i].x-s[j].x)*(s[i].x-s[j].x)+(s[i].y-s[j].y)*(s[i].y-s[j].y)); ss.push_back(mid); } } sort(ss.begin(),ss.end()); double ans; for(int i=0;i<=ss.size();i++) { //cout << ss[i].be << ss[i].eend << endl; if(findx(ss[i].be)!=findx(ss[i].eend)) { join(ss[i].be,ss[i].eend); if(findx(1)==findx(0)) { ans=ss[i].dis; break; } } } printf("Scenario #%d\n",cnt++); printf("Frog Distance = "); printf("%.3f\n",ans); printf("\n"); }}
阅读全文
0 0
- poj 2253 Frogger(最小生成树)
- POJ 2253 Frogger(最小生成树)
- POJ 2253 Frogger(最小生成树)
- POJ 2253 Frogger(最小生成树)
- POJ 2253 Frogger (最小生成树.Prim)
- Poj 2253 Frogger【最小生成树(巧解)】
- POJ 2253 Frogger 最小生成树
- poj 2253 Frogger 最小生成树
- POJ 2253 Frogger 最小生成树
- POJ 2253-Frogger(最小生成树-给定终点)
- POJ-2253 Frogger(三种最短路和最小生成树)
- POJ 2253 Frogger Kruskal最小生成树求解
- POJ 2253 Frogger (最小生成树 or 最短路变形)
- poj2253-Frogger (最小生成树)
- uva 534 - Frogger(最小生成树)
- POJ 2235 Frogger 最小生成树 Kruskal && Prim
- POJ 2253 Frogger(最小最大距离)
- POJ2253--Frogger--最小生成树Kruskal
- oracle 将当前系统时间戳插入timestamp字段
- Sroing boot访问postgresql数据库
- HTML基础标签笔记
- boost.tuple笔记
- 【JZOJ5328】【NOIP2017提高组模拟】世界线(STL)
- POJ 2253 Frogger(最小生成树)
- 用python3爬取代理服务器列表
- day1
- ArrayAdapter初步理解
- GOTO跳转标签
- SVN操作文档——客户端client安装(win/linux/ubuntu)
- Ubuntu14.04下安装最新的Cmake-3.8.2并为其配置环境变量(还介绍了其他三种方法)
- 计算机网络基础学习笔记
- 第六章 Realm及相关对象(四) PrincipalCollection