bzoj 2709: [Violet 1]迷宫花园 （最短路）

2709: [Violet 1]迷宫花园

Time Limit: 5 Sec   Memory Limit: 128 MB
Submit: 840   Solved: 288
[ Submit][ Status][ Discuss]

Description

Input

Output

Sample Input

5
10.28 9 9
#########
# #
# # # # #
#S# #
##### # #
## # #
# ### ###
##E #
#########
4.67 9 9
#########
# ## ##
### #S# #
# # E ##
# # #####
# ## ###
# ##### #
# # #
#########
39.06 9 9
#########
# #
# # # # #
# E# # #
# # # # #
## ### #
# # #S# #
##### #
#########
24.00 9 9
#########
# ##
# # ## ##
# # ##
###S## E#
### # ##
# # # #
##### # #
#########
25.28 9 9
#########
# S##E# #
# ### # #
# ## #
# ## ###
# # ####
# # # ###
# #
#########

Sample Output

0.41000
4.67000
3.34000
5.00000
1.69000

HINT

Source

POJ 3897 Maze Stretching

[ Submit][ Status][ Discuss]

题解：堆优化dijkstra

二分一个v，然后用最短路进行判定。精度需要控制好。。。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#define N 100003
#define eps 1e-7
#define pa pair<double,int> 
using namespace std; 
int n,m,tot,S,E,T,cnt,point[N],v[N],nxt[N],mp[103][103],vis[N];
double dis[N],c[N],L;
char s[103][103];
int px[5]={-1,0,1,0},py[5]={0,1,0,-1};
void add(int x,int y,double z)
{
	tot++; nxt[tot]=point[x]; point[x]=tot; v[tot]=y; c[tot]=z;
	//cout<<x<<" "<<y<<" "<<z<<endl;
}
double check(double len)
{
	for (int i=1;i<=cnt;i++) dis[i]=1e9,vis[i]=0;;
	dis[S]=0; 
	priority_queue<pa,vector<pa>,greater<pa> > p;
	p.push(make_pair(0,S));
	while (!p.empty()&&!vis[E]) {
		int now=p.top().second; p.pop();
		if (vis[now]) continue; vis[now]=1;
		for (int i=point[now];i;i=nxt[i]) {
			double t=1;
			if (c[i]==0) t=len;
			if (dis[v[i]]>dis[now]+t) {
				dis[v[i]]=dis[now]+t;
				p.push(make_pair(dis[v[i]],v[i]));
			}
		}
	}
	return dis[E];
}
int main()
{
	freopen("a.in","r",stdin);
	scanf("%d",&T); 
	while (T--) {
		scanf("%lf%d%d\n",&L,&n,&m); 
		for (int i=1;i<=n;i++) 
		 gets(s[i]+1);
		tot=0; cnt=0;
		memset(point,0,sizeof(point));
        for (int i=1;i<=n;i++)
         for (int j=1;j<=m;j++) mp[i][j]=++cnt;
		for (int i=1;i<=n;i++) 
		 for (int j=1;j<=m;j++) {
		 	if (s[i][j]=='#') continue;
		 	if (s[i][j]=='S') S=mp[i][j];
		 	if (s[i][j]=='E') E=mp[i][j];
		 	for (int k=0;k<4;k++) 
		 	 if (i+px[k]>=1&&i+px[k]<=n&&j+py[k]>=1&&j+py[k]<=m&&s[i+px[k]][j+py[k]]!='#') {
		 	  if (k==0||k==2) add(mp[i][j],mp[i+px[k]][j+py[k]],0);
		 	  else add(mp[i][j],mp[i+px[k]][j+py[k]],1);
		    }
		 }
		//cout<<S<<" "<<E<<endl;
		double l=0; double r=min(L,10.0); double ans=L;
		while (r-l>eps) {
			double mid=(l+r)/2.0;
			double t=check(mid); 
			if (check(mid)>=L) ans=min(ans,mid),r=mid-eps;
			else l=mid+eps;
		}
		printf("%.5lf\n",ans);
	}
}