UVA 10803 Thunder Mountain

纠结在这句话了If it is impossible to get from some town to some other town, print "Send Kurdy" instead. Put an empty line after each test case.

题目要求是如果一旦存在一个点不能到达另一个点就输出Send Kurdy

注意处理时跳过边长超过10的再跑FLOYD。之后在所有最短路中查找最大值即可

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b == 0 ? b : gcd(b, a % b);}
#define MAXN 105
double dp[MAXN][MAXN];
int x[MAXN],y[MAXN];
int N;
int main()
{//freopen("sample.txt","r",stdin);int T,kase = 1;scanf("%d",&T);while (T--){scanf("%d",&N);for (int i = 0; i <= N; i++)for (int j = 0; j <= N; j++)dp[i][j] = 10000000.0;for (int i = 1; i <= N; i++) scanf("%d%d",&x[i],&y[i]);for (int i = 1; i <= N; i++)for (int j = 1; j <= N; j++){double tmp = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) *(y[i] - y[j]);if (tmp > 100.0) continue;dp[i][j] = min(dp[i][j],sqrt(tmp));}for (int k = 1; k <= N; k++)for (int i = 1; i <= N; i++)for (int j = 1; j <= N; j++)dp[i][j] = min(dp[i][j],dp[i][k] + dp[k][j]);double ans = 0.0;for (int i = 1; i <= N; i++)for (int j = 1; j <= N; j++){ans = max(ans,dp[i][j]);}printf("Case #%d:\n",kase++);if (ans == 10000000.0) puts("Send Kurdy");else printf("%.4lf\n",ans);putchar('\n');}return 0;
}

转载于:https://www.cnblogs.com/Commence/p/4014081.html

UVA 10803 Thunder Mountain相关推荐

UVA 10803 - Thunder Mountain
Floyd求出任意两个城镇的距离,大于10的置为INF,使其不可达.然后求出符合条件的最大值, 输出如果都没有符合条件的就输出 Send Kurdy. #include<cstdio>#i ...
UVA10803 Thunder Mountain【Floyd算法】
"I mean, some people got guns, and some people got flashlights, and some people got batteries. ...
π-Algorithmist分类题目（2）
原题网站:Algorithmist,http://www.algorithmist.com/index.php/Main_Page π-Algorithmist分类题目(2) Set Theory U ...
提取了下刘汝佳推荐的题号...
今天闲来没事上uva oj提取了下刘汝佳推荐的acm题号,原始数据如下: Volume 0. Getting Started 10055 - Hashmat the Brave Warrior ...
初学者acm的练习题指南
上机练习题参考题忘了在哪找的啦~~希望对大家有帮助呦 1. Programming Bas ...
uva 12222——Mountain Road
题意:有一个狭窄的山路,两辆车不能同时相向而行,并且同向的车的间隔不能小于10秒,给定一些车的起始时间,求最后一辆车离开的最短时间. 思路:递推,dp(i,j,k)表示A端过了i辆车,B端过了j辆车, ...
[搜索]UVa 129 困难的串
题意:将一个包含两个相邻的重复子串的子串,称为"容易的串",其他为"困难的串". 输入正整数n和l,输出由前l个字符组成的,字典序第n小的困难的串. 输入样例: ...
uva 401.Palindromes
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem ...
Uva 3767 Dynamic len(set(a[L:R])) 树套树
Dynamic len(set(a[L:R])) Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 https://uva.onlinejudge.org/in ...

UVA 10803 Thunder Mountain

UVA 10803 Thunder Mountain相关推荐

最新文章

热门文章