POJ 1556 The Doors 判断线段相交+最短路

题目描述：http://poj.org/problem?id=1556

解题思路：

以起点、终点和每面墙上的四个端点作为节点跑最短路。如果两个端点的连线之间不与其他线段相交（不包括端点），那么这两个节点的距离就是欧氏距离，否则不可达。

复杂度：

计算每个节点之间距离O(n^3)，最短路O(n^2)。总复杂度O(n^3)。

<span style="font-family:Microsoft YaHei;font-size:12px;">#include "stdio.h"
#include "math.h"
#include "memory.h"
#define EPS 1e-8
#define MAXW 207
#define MAXN MAXW*4 + 17
#define INF 100

struct point {
	double x, y;
}p[MAXN];
struct wall {
	double x, y1, y2, y3, y4;
}w[MAXW];

int nw, n;
double d[MAXN][MAXN], s[MAXN];

double dist(struct point a, struct point b) {
	return sqrt(pow(b.x-a.x, 2) + pow(b.y-a.y, 2));
}

double max(double a, double b) {return a>b?a:b;}
double min(double a, double b) {return a>b?b:a;}

double cross(struct point a, struct point b, struct point c) {
	double x1 = b.x-a.x, y1 = b.y-a.y;
	double x2 = c.x-a.x, y2 = c.y-a.y;
	return x1*y2-x2*y1;
}

bool onSegment(struct point a, struct point b, struct point c) {
	if (min(a.x, b.x)<=c.x && c.x<=max(a.x, b.x) 
	 && min(a.y, b.y)<=c.y && c.y<=max(a.y, b.y))
		return true;
	return false;
}

bool intersect(struct point a1, struct point b1, struct point a2, struct point b2) {
	double p1 = cross(a1, b1, a2);
	double p2 = cross(a1, b1, b2);
	double p3 = cross(a2, b2, a1);
	double p4 = cross(a2, b2, b1);
	if (p1*p2<0 && p3*p4<0) return true;
	if (fabs(p1)<EPS && onSegment(a1, b1, a2)) return true;
	if (fabs(p2)<EPS && onSegment(a1, b1, b2)) return true;
	if (fabs(p3)<EPS && onSegment(a2, b2, a1)) return true;
	if (fabs(p4)<EPS && onSegment(a2, b2, b1)) return true;
	return false;
}

void initD() {
	int i, j, k;
	for (i=0; i<n; i++) {
		d[i][i] = 0;
		for (j=i+1; j<=n; j++) {
			d[j][i] = d[i][j] = INF;
			if (p[i].x == p[j].x) continue;
			bool clear = true;
			int lw = (i-1)/4+2, rw = (j-1)/4;
			if (!i) lw = 1; 
			for (k=lw; k<=rw; k++) {
				struct point a2, b2;
				a2.x = b2.x = w[k].x; 
				a2.y = w[k].y2;
				b2.y = w[k].y1;
				bool flag1 = intersect(p[i], p[j], a2, b2);
				a2.y = w[k].y4;
				b2.y = w[k].y3;
				bool flag2 = intersect(p[i], p[j], a2, b2);
				clear &= (flag1 || flag2);
				if (!clear) break;
			}
			if (clear) {
				d[i][j] = dist(p[i], p[j]);
			} 
		}
	}
}

void init() {
	int i;
	n=0;
	p[n].x = 0; p[n].y = 5;
	for (i=1; i<=nw; i++) {
		scanf("%lf %lf %lf %lf %lf", &w[i].x, &w[i].y1, &w[i].y2, &w[i].y3, &w[i].y4);
		n++; p[n].x = w[i].x; p[n].y = w[i].y1;
		n++; p[n].x = w[i].x; p[n].y = w[i].y2;
		n++; p[n].x = w[i].x; p[n].y = w[i].y3;
		n++; p[n].x = w[i].x; p[n].y = w[i].y4;
	}
	n++; p[n].x = 10; p[n].y = 5;

	initD();
}

void dijk() {
	int i, j, k;
	bool v[MAXN];
	memset(v, false, sizeof(v));


	for (i=0; i<=n; i++) s[i] = d[0][i];
	v[0] = true;

	for (i=1; i<=n; i++) {
		double mn = INF;
		k = 0;
		for (j=1; j<=n; j++) {
			if (!v[j] && s[j]<mn) {
				mn = s[j];
				k = j;
			}
		}
		v[k] = true;
		if (k==n) return;
		for (j=1; j<=n; j++) {
			if (!v[j] && (s[k]+d[k][j] < s[j])) {
				s[j] = d[k][j] + s[k];
			}
		}
	}
}

int main() {
	scanf("%d", &nw);
	while (nw != -1) {
		init();
		dijk();
		printf("%.2lf\n", s[n]);

		scanf("%d", &nw);
	}
	return 0;
}</span>