ACM/ICPC 之 Floyd练习六道(ZOJ2027-POJ2253-POJ2472-POJ1125-POJ1603-POJ2607)
以Floyd解法为主的练习题六道
ZOJ2027-Travelling Fee
//可免去一条线路中直接连接两城市的最大旅行费用,求最小总旅行费用
//Time:0Ms Memory:604K
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std; #define MAX 205
#define MAXS 12
#define INF 0x3f3f3f3f int n,m;
int dis[MAX][MAX];
int high[MAX][MAX]; //该线路中直接连接两城市的最大旅行费用 struct City {
char name[MAXS];
}c[MAX]; int find(char s[MAXS])
{
for (int i = 0; i < n; i++)
if (!strcmp(s, c[i].name)) return i;
return -1;
} void floyd()
{
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
{
if (high[i][k] == -1 || high[k][j] == -1) continue;
int maxCost = max(high[i][k], high[k][j]);
if (dis[i][j] - high[i][j] > dis[i][k] + dis[k][j] - maxCost)
{
dis[i][j] = dis[i][k] + dis[k][j];
high[i][j] = maxCost;
}
}
} int main()
{
while (scanf("%s%s", c[0].name, c[1].name) != EOF)
{
memset(dis, INF, sizeof(dis));
memset(high, -1, sizeof(high));
int d; n = 2;
char s[MAXS],t[MAXS];
scanf("%d", &m);
while (m--)
{
scanf("%s%s%d", s, t, &d);
int ns = find(s), nt = find(t);
if (ns == -1) {
memcpy(c[n].name, s, sizeof(s));
ns = n++;
}
if (nt == -1) {
memcpy(c[n].name, t, sizeof(t));
nt = n++;
}
high[ns][nt] = dis[ns][nt] = d;
}
floyd();
printf("%d\n", dis[0][1] - high[0][1]);
} return 0;
}
POJ2253-Frogger
//求0->1间的最小的最大单次青蛙跳跃距离
//Time:94Ms Memory:508K
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std; #define MAX 205
#define POW2(x) ((x)*(x))
#define DIS(a,b) (sqrt(POW2(p[a].x - p[b].x) + POW2(p[a].y - p[b].y))) struct Point {
double x, y;
}p[MAX]; int n;
double dis[MAX][MAX]; //两点间最小的最大一次跳跃距离 void floyd()
{
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dis[i][j] = min(dis[i][j], max(dis[i][k], dis[k][j]));
} int main()
{
int cas = 1;
while (scanf("%d", &n), n)
{
for (int i = 0; i < n; i++)
{
scanf("%lf%lf", &p[i].x, &p[i].y);
for (int j = 0; j < i; j++)
dis[i][j] = dis[j][i] = DIS(i, j);
dis[i][i] = 0;
} floyd();
printf("Scenario #%d\n", cas++);
printf("Frog Distance = %.3f\n\n", dis[0][1]);
}
return 0;
}
POJ2472-106 miles to Chicago
//求1到n的最大存活率
//Time:157Ms Memory:264K
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std; #define MAX 105
int n, m;
double dis[MAX][MAX]; void floyd()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
dis[i][j] = max(dis[i][j], dis[i][k] * dis[k][j]);
} int main()
{
while (scanf("%d%d", &n, &m), n)
{
memset(dis, 0, sizeof(dis));
int x, y, d;
while (m--) {
scanf("%d%d%d", &x, &y, &d);
dis[x][y] = dis[y][x] = d / 100.0;
}
floyd();
printf("%.6lf percent\n", 100*dis[1][n]);
}
return 0;
}
POJ1125-Stockbroker Grapevine
//从某点扩散到所有点的最短时间-求出该点及时间
//Time:0Ms Memory:208K
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std; #define MAX 105
#define INF 0x3f3f3f3f int n, m;
int dis[MAX][MAX];
int time[MAX]; void floyd()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
} int main()
{
while (scanf("%d", &n), n)
{
memset(dis, INF, sizeof(dis));
memset(time, 0, sizeof(time));
int y, d;
for (int x = 1; x <= n; x++)
{
scanf("%d", &m);
while (m--) {
scanf("%d%d", &y, &d);
dis[x][y] = d;
dis[x][x] = 0;
}
}
floyd();
int Min = INF;
int k = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
time[i] = max(time[i], dis[i][j]);
for (int i = 1; i <= n; i++)
{
if (Min > time[i])
{
Min = time[i];
k = i;
}
}
if (Min == INF) printf("disjoint\n");
else printf("%d %d\n", k, Min);
}
return 0;
}
POJ1603-Risk
//求依靠攻打接壤国需要最少攻打多少国家才能从起始国家打到终止国家
//Time:0Ms Memory:168K
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std; #define MAX 21
#define INF 0x3f3f3f3f int n, m;
int dis[MAX][MAX]; void floyd()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
} int main()
{
int cas = 0;
n = 20;
while (scanf("%d", &m) != EOF)
{
memset(dis, INF, sizeof(dis));
int x, y;
for (x = 1; x <= 19; x++)
{
while (m--) {
scanf("%d", &y);
dis[x][y] = dis[y][x] = 1;
}
scanf("%d", &m);
}
floyd();
if (cas) printf("\n");
printf("Test Set #%d\n", ++cas);
while (m--) {
scanf("%d%d", &x, &y);
printf("%d to %d: %d\n", x, y, dis[x][y]);
}
}
return 0;
}
POJ2607-Fire Station
这道题稍微比上面的五道题复杂一些
//Floyd解法
//已知消防站,现建新消防站,使得所有路口到消防站的最大值减至最小,将最小序列路口输出
//Time:1797Ms Memory:1164K
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std; #define MAX 505
#define INF 0x3f3f3f3f int f, n, m;
int dis[MAX][MAX];
bool v[MAX];
int md[MAX]; //各路口到消防站最短距离 void floyd()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
} int main()
{
memset(dis, INF, sizeof(dis));
memset(md, INF, sizeof(md));
scanf("%d%d", &f, &n);
int x, y, d;
for (int i = 0; i < f;i++){
scanf("%d", &x);
v[x] = true;
dis[x][x] = 0;
}
while (scanf("%d%d%d", &x, &y, &d) != EOF)
dis[x][y] = dis[y][x] = d;
floyd();
for (int i = 1; i <= n; i++)
{
dis[i][i] = 0;
if (!v[i]) continue;
for (int j = 1; j <= n; j++)
md[j] = min(md[j], dis[i][j]);
} int Max = INF, k = 1; //默认为1,否则A不掉(我怀疑数据有问题或题目描述不清)
for (int i = 1; i <= n; i++)
{
if (v[i]) continue;
int tmp = 0;
for (int j = 1; j <= n; j++)
tmp = max(tmp, min(md[j], dis[i][j]));
if (Max > tmp)
{
Max = tmp;
k = i;
}
}
printf("%d\n", k);
return 0;
}
ACM/ICPC 之 Floyd练习六道(ZOJ2027-POJ2253-POJ2472-POJ1125-POJ1603-POJ2607)的更多相关文章
- ACM/ICPC 之 Floyd范例两道(POJ2570-POJ2263)
两道以Floyd算法为解法的范例,第二题如果数据量较大,须采用其他解法 POJ2570-Fiber Network //经典的传递闭包问题,由于只有26个公司可以采用二进制存储 //Time:141M ...
- ACM/ICPC 之 Floyd+记录路径后继(Hdu1385(ZOJ1456))
需要处理好字典序最小的路径 HDU1385(ZOJ1456)-Minimum Transport //Hdu1385-ZOJ1456 //给定邻接矩阵,求给定起点到终点的最短路径,若有相同路长的路径按 ...
- 2014嘉杰信息杯ACM/ICPC湖南程序设计邀请赛暨第六届湘潭市程序设计竞赛
比赛链接: http://202.197.224.59/OnlineJudge2/index.php/Contest/problems/contest_id/36 题目来源: 2014嘉杰信息杯ACM ...
- ACM/ICPC 之 BFS(离线)+康拓展开(TSH OJ-玩具(Toy))
祝大家新年快乐,相信在新的一年里一定有我们自己的梦! 这是一个简化的魔板问题,只需输出步骤即可. 玩具(Toy) 描述 ZC神最擅长逻辑推理,一日,他给大家讲述起自己儿时的数字玩具. 该玩具酷似魔方, ...
- ACM ICPC 2015 Moscow Subregional Russia, Moscow, Dolgoprudny, October, 18, 2015 G. Garden Gathering
Problem G. Garden Gathering Input file: standard input Output file: standard output Time limit: 3 se ...
- ACM ICPC 2015 Moscow Subregional Russia, Moscow, Dolgoprudny, October, 18, 2015 D. Delay Time
Problem D. Delay Time Input file: standard input Output file: standard output Time limit: 1 second M ...
- hduoj 4710 Balls Rearrangement 2013 ACM/ICPC Asia Regional Online —— Warmup
http://acm.hdu.edu.cn/showproblem.php?pid=4710 Balls Rearrangement Time Limit: 6000/3000 MS (Java/Ot ...
- 【转】lonekight@xmu·ACM/ICPC 回忆录
转自:http://hi.baidu.com/ordeder/item/2a342a7fe7cb9e336dc37c89 2009年09月06日 星期日 21:55 初识ACM最早听说ACM/ICPC ...
- 【转】ACM/ICPC生涯总结暨退役宣言—alpc55
转自:http://hi.baidu.com/accplaystation/item/ca4c2ec565fa0b7fced4f811 ACM/ICPC生涯总结暨退役宣言—alpc55 前言 早就该写 ...
随机推荐
- 将Ubuntu 15.10升级到Ubuntu 16.04
Ubuntu 16.04 LTS 代号为 Xenial Xerus,其最终版将于 2016 年 4 月 21 日正式发布,Ubuntu16.04 将是非常受欢迎的开源操作系统 Ubuntu 的第 6 ...
- Linux 运行 apt-get install 就出现jdk installer 错误的解决方法
解决办法如下: sudo rm /var/lib/dpkg/info/oracle-java7-installer* sudo apt-get purge oracle-java7-installer ...
- 30秒搭建Github Page
如果中国每个程序员都写博客,那么中国IT届的春天就来了 原文转自我的前端博客,链接:http://www.hacke2.cn/create-github-page/ 有同学问我的网站是怎么创建的,其实 ...
- ASP.NET 大文件下载的实现思路及代码
文件下载是一个网站最基本的功能,ASP.NET网站的文件下载功能实现也很简单,但是如果遇到大文件的下载而不做特殊处理的话,那将会出现不可预料的后果.本文就基于ASP.NET提供大文件下载的实现思路及代 ...
- XMAL语法系列之-(2)---WPF控件继承图
WPF控件继承图 1 FrameworkElement 1.1 Panel(面板类元素) 1.1.1 Canvas 1.1.2 DockPanel 1.1.3 Grid 1.1.4 TabPanel ...
- ACM3 求最值
/*2*2014.11.18*求最值*描述:给定N个整数(1<=N<=100),求出这N个数中的最大值,最小值.*输入:多组数据,第一行为一个整数N,第二行为N个不超过100的正整数,用空 ...
- UML之用例图
用例图概要 ²用例图是被称为参与者的外部用户所能观察到的系统功能的模型图. (<UML参考手册>) ²用例图列出系统中的用例和系统外的参与者,并显示哪个参与者参与了哪个用例的执行 (或称为 ...
- 2013长沙赛区现场赛 J - Josephina and RPG
J - Josephina and RPG Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I6 ...
- java的封装
- jquery选择器(一)-基础选择器
1. ID元素选择器 $("#btn1") 2. class元素选择器 $(".btn") 3. 标签元素选择器 $("div") 4. 全 ...