当前位置:网站首页>POJ training plan 2253_ Frogger (shortest /floyd)
POJ training plan 2253_ Frogger (shortest /floyd)
2022-07-07 04:06:00 【Full stack programmer webmaster】
Hello everyone , I meet you again , I'm the king of the whole stack
Solution report
Serie A Champion :
begging 0 to 1 The minimum number of all the largest road values .
thinking :
floyd.
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#define inf 0x3f3f3f3f
using namespace std;
int n,m,q;
double mmap[210][210];
struct node {
double x,y;
} p[210];
double dis(node p1,node p2) {
return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
void floyd() {
for(int k=0; k<n; k++)
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
mmap[i][j]=min(mmap[i][j],max(mmap[i][k],mmap[k][j]));
}
int main() {
int i,j,u,v,w,k=1;
while(~scanf("%d",&n)) {
if(!n)break;
for(i=0; i<n; i++) {
for(j=0; j<n; j++)
mmap[i][j]=(double)inf;
mmap[i][i]=0;
}
for(i=0; i<n; i++) {
scanf("%lf%lf",&p[i].x,&p[i].y);
}
for(i=0; i<n; i++) {
for(j=0; j<n; j++) {
mmap[i][j]=dis(p[i],p[j]);
}
}
floyd();
printf("Scenario #%d\n",k++);
printf("Frog Distance = %.3lf\n",mmap[0][1]);
printf("\n");
}
return 0;
}
Frogger
Time Limit: 1000MS | Memory Limit: 65536K | |
---|---|---|
Total Submissions: 25958 | Accepted: 8431 |
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.
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
2
0 0
3 4
3
17 4
19 4
18 5
0
Sample Output
Scenario #1
Frog Distance = 5.000
Scenario #2
Frog Distance = 1.414
Publisher : Full stack programmer stack length , Reprint please indicate the source :https://javaforall.cn/116705.html Link to the original text :https://javaforall.cn
边栏推荐
- [hcie TAC] question 3
- QT opens a file and uses QFileDialog to obtain the file name, content, etc
- The most complete learning rate adjustment strategy in history LR_ scheduler
- 史上最全MongoDB之安全认证
- easyui出口excel无法下载框弹出的办法来解决
- 2022夏每日一题(一)
- 史上最全MongoDB之初识篇
- 红米k40s root玩机笔记
- Restore backup data on GCS with tidb lightning
- HW-小记(二)
猜你喜欢
随机推荐
It's too convenient. You can complete the code release and approval by nailing it!
easyui出口excel无法下载框弹出的办法来解决
Optimization cases of complex factor calculation: deep imbalance, buying and selling pressure index, volatility calculation
【开发软件】 tilipa开发者软件
Gpt-3 is a peer review online when it has been submitted for its own research
Do you choose pandas or SQL for the top 1 of data analysis in your mind?
Use dumping to back up tidb cluster data to GCS
When QT uses qtooltip mouse to display text, the picture of the button will also be displayed and the prompt text style will be modified
接口数据安全保证的10种方式
史上最全学习率调整策略lr_scheduler
Redis configuration and optimization of NoSQL
手机号国际区号JSON格式另附PHP获取
Implementation of map and set
Antd Comment 递归循环评论
太方便了,钉钉上就可完成代码发布审批啦!
Preprocessing - interpolation
[record of question brushing] 2 Add two numbers
C task expansion method
ERROR: Could not build wheels for pycocotools which use PEP 517 and cannot be installed directly
【mysql】mysql中行排序