UVALive - 6572 Shopping Malls floyd
题目链接:
http://acm.hust.edu.cn/vjudge/problem/48416
Shopping Malls
Time Limit: 3000MS
#### 问题描述
> We want to create a smartphone application to help visitors of a shopping mall and you have to calculate
> the shortest path between pairs of locations in the mall. Given the current location of the visitor and his
> destination, the application will show the shortest walking path (in meters) to arrive to the destination.
> The mall has N places in several floors connected by walking paths, lifts, stairs and escalators
> (automated stairs). Note that the shortest path in meters may involve using an escalator in the
> opposite direction. We only want to count the distance that the visitor has walked so each type of
> movement between places has a different cost in meters:
> • If walking or taking the stairs the distance is the euclidean distance between the points.
> • Using the lift has a cost of 1 meter because once we enter the lift we do not walk at all. One
> lift can only connect 2 points. An actual lift connects the same point of different floors, in the
> map all the points connected by a lift have the corresponding edge. So you do not need to worry
> about that. For instance, if there are three floors and one lift at position (1,2) of each floor, the
> input contains the edges (0, 1, 2) → (1, 1, 2), (1, 1, 2) → (2, 1, 2) and (0, 1, 2) → (2, 1, 2). In some
> maps it can be possible that a lift does not connect all the floors, then some of the edges will not
> be in the input.
> • The escalator has two uses:
> – Moving from A to B (proper direction) the cost is 1 meter because we only walk a few steps
> and then the escalator moves us.
> – Moving from B to A (opposite direction) has a cost of the euclidean distance between B and
> A multiplied by a factor of 3.
> The shortest walking path must use only these connections. All the places are connected to each
> other by at least one path.
#### 输入
> The input file contains several data sets, each of them as described below. Consecutive
> data sets are separated by a single blank line.
> Each data set contains the map of a unique shopping mall and a list of queries.
> The first line contains two integers N (N ≤ 200) and M (N −1 ≤ M ≤ 1000), the number of places
> and connections respectively. The places are numbered from 0 to N −1. The next N lines contain floor
> and the coordinates x, y of the places, one place per line. The distance between floors is 5 meters. The
> other two coordinates x and y are expressed in meters.
> The next M lines contain the direct connections between places. Each connection is defined by the
> identifier of both places and the type of movement (one of the following: ‘walking’, ‘stairs’, ‘lift’,
> or ‘escalator’). Check the cost of each type in the description above. The type for places in the same
> floor is walking.
> The next line contains an integer Q (1 ≤ Q ≤ 1000) that represents the number of queries that
> follow. The next Q lines contain two places each a and b. We want the shortest walking path distance
> to go from a to b.
#### 输出
> For each data set in the input the output must follow the description below. The outputs
> of two consecutive data sets will be separated by a blank line.
> For each query write a line with the shortest path in walked meters from the origin to the destination,
> with each place separated by a space.
样例
sample input
6 7
3 2 3
3 5 3
2 2 3
2 6 4
1 1 3
1 4 2
0 1 walking
0 2 lift
1 2 stairs
2 3 walking
3 4 escalator
5 3 escalator
4 5 walking
5
0 1
1 2
3 5
5 3
5 1sample output
0 1
1 0 2
3 4 5
5 3
5 3 2 0 1
题解
floyd最短路+路径记录。注意重边和输出格式
代码
#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define X first
#define Y second
#define mkp make_pair
#define lson (o<<1)
#define rson ((o<<1)|1)
#define mid (l+(r-l)/2)
#define pb(v) push_back(v)
#define all(o) (o).begin(),(o).end()
#define clr(a,v) memset(a,v,sizeof(a))
#define bug(a) cout<<#a<<" = "<<a<<endl
#define rep(i,a,b) for(int i=a;i<(b);i++)
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int,int> PII;
typedef vector<pair<int,int> > VPII;
const int INF=0x3f3f3f3f;
const LL INFL=0x3f3f3f3f3f3f3f3fLL;
const int maxn=222;
struct Point{
double x,y,z;
}pt[maxn];
double mat[maxn][maxn];
int pre[maxn][maxn];
int n,m;
double dis(const Point& p1,const Point& p2){
return sqrt(25*(p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y)+(p1.z-p2.z)*(p1.z-p2.z));
}
void init(){
rep(i,0,n+1) rep(j,0,n+1){
mat[i][j]=INF*1.0;
if(i==j) mat[i][j]=0;
pre[i][j]=i;
}
}
int main(){
int kase=0;
while(scanf("%d%d",&n,&m)==2&&n){
init();
if(kase++) puts("");
rep(i,0,n) scanf("%lf%lf%lf",&pt[i].x,&pt[i].y,&pt[i].z);
while(m--){
int u,v; char str[22];
scanf("%d%d%s",&u,&v,str);
double val;
if(str[0]=='w'||str[0]=='s'){
mat[u][v]=min(mat[u][v],dis(pt[u],pt[v]));
mat[v][u]=min(mat[v][u],dis(pt[v],pt[u]));
}else if(str[0]=='e'){
mat[u][v]=min(mat[u][v],1.0);
mat[v][u]=min(mat[v][u],3*dis(pt[u],pt[v]));
}else{
mat[u][v]=min(mat[u][v],1.0);
mat[v][u]=min(mat[v][u],1.0);
}
}
rep(k,0,n) rep(i,0,n) rep(j,0,n){
if(mat[i][j]>mat[i][k]+mat[k][j]){
mat[i][j]=mat[i][k]+mat[k][j];
pre[i][j]=pre[k][j];
}
}
int q;
scanf("%d",&q);
while(q--){
int u,v;
scanf("%d%d",&u,&v);
VI path;
path.pb(v);
while(pre[u][v]!=u){
// bug(v);
path.pb(pre[u][v]);
v=pre[u][v];
}
path.pb(u);
reverse(all(path));
rep(i,0,path.size()-1) printf("%d ",path[i]);
printf("%d\n",path[path.size()-1]);
}
}
return 0;
}
UVALive - 6572 Shopping Malls floyd的更多相关文章
- POJ 3831 & HDU 3264 Open-air shopping malls(几何)
题目链接: POJ:id=3831" target="_blank">http://poj.org/problem?id=3831 HDU:http://acm.h ...
- Open-air shopping malls(二分半径,两元交面积)
http://acm.hdu.edu.cn/showproblem.php?pid=3264 Open-air shopping malls Time Limit: 2000/1000 MS (Jav ...
- hdu 3264 09 宁波 现场 E - Open-air shopping malls 计算几何 二分 圆相交面积 难度:1
Description The city of M is a famous shopping city and its open-air shopping malls are extremely at ...
- HDU 3264/POJ 3831 Open-air shopping malls(计算几何+二分)(2009 Asia Ningbo Regional)
Description The city of M is a famous shopping city and its open-air shopping malls are extremely at ...
- 贪心 UVALive 6834 Shopping
题目传送门 /* 题意:有n个商店排成一条直线,有一些商店有先后顺序,问从0出发走到n+1最少的步数 贪心:对于区间被覆盖的点只进行一次计算,还有那些要往回走的区间步数*2,再加上原来最少要走n+1步 ...
- hdu 3264 Open-air shopping malls(圆相交面积+二分)
Open-air shopping malls Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/ ...
- UVALive 4431 Fruit Weights --floyd,差分约束?
题意: 给出一些关系用aX <= bY表示, 最后查询aX 和 bY的关系,是>=,==,<=,还是不能确定,还是出现了矛盾. 解法:对每一个关系其实都可以建一条X->Y的边, ...
- hdu3264Open-air shopping malls(二分)
链接 枚举伞的圆心,最多只有20个,因为必须与某个现有的圆心重合. 然后再二分半径就可以了. #include <iostream> #include<cstdio> #inc ...
- HDU 3264 Open-air shopping malls (计算几何-圆相交面积)
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=3264 题意:给你n个圆,坐标和半径,然后要在这n个圆的圆心画一个大圆,大圆与这n个圆相交的面积必须大于等 ...
随机推荐
- 观察者(observer)设计模式
转载:http://www.tracefact.net/CSharp-Programming/Delegates-and-Events-in-CSharp.aspx 假设我们有个高档的热水器,我们给它 ...
- JS限定手机版中图片大小随分辨率自动调整
<script type="text/javascript"> var ObjImg = jQuery(".Dy_Content img"); fo ...
- C# 随机颜色的方法
public string GetRandomColor() { Random RandomNum_First = new Random((int)DateTime.Now.Ticks); // 对于 ...
- android学习视频分享
最近整理了大量的安卓开发学习资料,有书籍有视频有代码,老罗的第一季有点老了, 这里就给大家分享下老罗的第二季的视频教程吧,还有源码,初级到高级程序猿都有用. 下载地址:http://51pansou. ...
- ASP.NET的错误处理机制之一(概念)
对Web应用程序来说,发生不可预知的错误和异常在所难免,我们必须为Web程序提供错误处理机制.当错误发生时,我们必须做好两件事情:一是将错误信息记录日志,发邮件通知网站维护人员,方便技术人员对错误进行 ...
- php中empty(), is_null(), isset()函数区别
empty(), is_null(), isset()真值表(区别) 我们先来看看这3个函数的功能描述 www.111cn.net isset 判断变量是否已存在,如果变量存在则返回 TRUE,否则返 ...
- C++primer 阅读点滴记录(一)
第十三章 复制控制:(copy control) 复制构造函数(copy constructor) 复制操作符(assignment operator) ps: 什么时候需要显示的定义复制控制操作:类 ...
- SqlBulkCopy 插入100W条数据时 属性BatchSize的作用
(1)100W条insert语句在一个连接内一句一句加 花了01:17:19.0542805 (2) SqlBulkCopy 插入100W条数据 设置BatchSize=500 耗时:00:03:29 ...
- LinearRegressionWithRegularization
在线性回归的基础上加上正则项: # -*-coding:utf-8 -*- ''' Created on 2016年12月15日 @author: lpworkdstudy ''' import nu ...
- ED/EP系列6《扩展应用》
包括:电子钱包复合应用:电子钱包灰锁应用. 1. 复合应用模式 Ø INITIALIZE FOR CAPP PURCHASE(复合应用消费初始化): Ø UPDATE CAPP DATA CACHE( ...