hdu4179(有限制的最短路）

1 #include
2 #include
3 #include
4 #include
5 #include
6 #include
7 #include
8 using namespace std;
9 typedef pair<int,double>Pair;
10 #define MAXN 44444
11 #define inf 1e16
12 double dist1[MAXN],dist2[MAXN];
13 bool mark[MAXN];
14 struct Edge{
15 int v;
16 double w;
17 Edge(){}
18 Edge(int _v,double _w){
19 v&＃61;_v,w&＃61;_w;
20 }
21 };
22 vectormap1[MAXN],map2[MAXN];
23 vector<int>vet;
24 struct Point{
25 int x,y,z;
26 }point[MAXN];
27
28 struct Node{
29 int vs,vt;
30 }node[MAXN];
31 int n,m,st,ed,maxdist;
32
33 double Get_Dist(int vs,int vt){
34 double xx&＃61;1.0*(point[vs].x-point[vt].x)*(point[vs].x-point[vt].x);
35 double yy&＃61;1.0*(point[vs].y-point[vt].y)*(point[vs].y-point[vt].y);
36 double zz&＃61;1.0*(point[vs].z-point[vt].z)*(point[vs].z-point[vt].z);
37 return sqrt(xx&＃43;yy&＃43;zz);
38 }
39
40 int Get(int vs,int vt){
41 if(point[vs].z<point[vt].z){
42 double xx&＃61;1.0*(point[vs].x-point[vt].x)*(point[vs].x-point[vt].x);
43 double yy&＃61;1.0*(point[vs].y-point[vt].y)*(point[vs].y-point[vt].y);
44 double dd&＃61;sqrt(xx&＃43;yy);
45 return (int)(100*(point[vt].z-point[vs].z)/dd);
46 }
47 return 0;
48 }
49
50 void SPFA(int st,vectormap[],double dist[])
51 {
52 memset(mark,false,(n&＃43;2)*sizeof(mark[0]));
53 for(int i&＃61;1;i<&＃61;n;i&＃43;&＃43;)dist[i]&＃61;inf;
54 dist[st]&＃61;0;mark[st]&＃61;true;
55 queue<int>Q;
56 Q.push(st);
57 while(!Q.empty()){
58 int u&＃61;Q.front();
59 Q.pop();
60 mark[u]&＃61;false;
61 for(int i&＃61;0;i){
62 int v&＃61;map[u][i].v;
63 double w&＃61;map[u][i].w;
64 if(dist[u]&＃43;w<dist[v]){
65 dist[v]&＃61;dist[u]&＃43;w;
66 if(!mark[v]){ mark[v]&＃61;true;Q.push(v); }
67 }
68 }
69 }
70 }
71
72
73 int main()
74 {
75 // freopen("1.txt","r",stdin);
76 while(scanf("%d%d",&n,&m),(n&＃43;m)){
77 for(int i&＃61;1;i<&＃61;n;i&＃43;&＃43;){ map1[i].clear();map2[i].clear();};
78 vet.clear();
79 for(int i&＃61;1;i<&＃61;n;i&＃43;&＃43;){
80 scanf("%d%d%d",&point[i].x,&point[i].y,&point[i].z);
81 }
82 for(int i&＃61;1;i<&＃61;m;i&＃43;&＃43;){
83 scanf("%d%d",&node[i].vs,&node[i].vt);
84 }
85 scanf("%d%d%d",&st,&ed,&maxdist);
86 for(int i&＃61;1;i<&＃61;m;i&＃43;&＃43;){
87 double dd&＃61;Get_Dist(node[i].vs,node[i].vt);
88 int d1&＃61;Get(node[i].vs,node[i].vt);
89 int d2&＃61;Get(node[i].vt,node[i].vs);
90 if(d1<&＃61;maxdist){
91 map1[node[i].vs].push_back(Edge(node[i].vt,dd));
92 map2[node[i].vt].push_back(Edge(node[i].vs,dd));
93 }
94 if(d2<&＃61;maxdist){
95 map1[node[i].vt].push_back(Edge(node[i].vs,dd));
96 map2[node[i].vs].push_back(Edge(node[i].vt,dd));
97 }
98 if(d1&＃61;&＃61;maxdist){
99 vet.push_back(node[i].vs);
100 vet.push_back(node[i].vt);
101 }
102 if(d2&＃61;&＃61;maxdist){
103 vet.push_back(node[i].vt);
104 vet.push_back(node[i].vs);
105 }
106 }
107 SPFA(st,map1,dist1);
108 SPFA(ed,map2,dist2);
109 double ans&＃61;inf;
110 for(int i&＃61;0;i2){
111 int x&＃61;vet[i],y&＃61;vet[i&＃43;1];
112 double dd&＃61;dist1[x]&＃43;Get_Dist(x,y)&＃43;dist2[y];
113 if(dddd;
114 }
115 if(ans<inf){
116 printf("%.1lf\n",ans);
117 }else
118 puts("None");
119 }
120 return 0;
121 }