#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXN 105
#define R 7.5
//记录鳄鱼~~节点坐标
struct Node {
int x, y;
}V[MAXN];
int n, d;
int cnt = 0, temp;
int G[MAXN][MAXN];
int D[MAXN], P[MAXN], t[MAXN];
int Distance(int a, int b, int c, int d) {
return (a-c)*(a-c)+(b-d)*(b-d);
}
//为了给第一跳的节点距离排序,其实用qsort更好。
void SortFirst() {
int i, j, k;
for(i = 0; i < n; i++)
if(Distance(V[i].x, V[i].y, 0, 0) <= (d+R)*(d+R) && Distance(V[i].x, V[i].y, 0, 0) >= R*R) t[cnt++] = i;
for(i = 0; i < cnt; i++) {
k = i;
for(j = i; j < cnt; j++) {
if(Distance(V[t[j]].x, V[t[j]].y, 0, 0) < Distance(V[t[k]].x, V[t[k]].y, 0, 0)) {
temp = t[j];
t[j] = t[i];
t[i] = temp;
}
}
}
}
int Escape(int x, int y) {
if(x < 0) x = -x;
if(y < 0) y = -y;
if(x+d>=50 || y+d>=50) return 1;
else return 0;
}
void BuildGraph() {
int i, j, k;
for(i = 0; i <= n; i++) { D[i] = -1; P[i] = -1; }
for(i = 0; i < n; i++) {
for(j = 0; j < n; j++) {
if(Distance(V[i].x, V[i].y, V[j].x, V[j].y) <= d*d)
G[i][j] = G[j][i] = 1;
}
G[i][n] = G[n][i] = Escape(V[i].x, V[i].y);
}
}
void BFS(int s) {
int Q[MAXN], front, rear, v, i;
front = rear = 0;
Q[++rear] = s;
D[s] = 1;
while(rear != front) {
v = Q[++front];
//printf("Now is %d\n", v);
for(i = 0; i <= n; i++) {
if(G[i][v] && D[i] == -1) {
Q[++rear] = i;
D[i] = D[v] + 1;
P[i] = v;
}
}
}
}
void PrintGraph() {
int i, j, k;
for(i = 0; i <= n; i++) {
for(j = 0; j <= n; j++) {
printf("%3d", G[i][j]);
}
printf("\n");
}
}
int main() {
int i, j, k;
int stack[MAXN], rear = 0, flag = 0;
int p;
scanf("%d%d", &n, &d);
for(i = 0; i < n; i++)
scanf("%d%d", &V[i].x, &V[i].y);
if(d >= 50) { flag = 1; goto there; }
SortFirst(); //for(i = 0; i < cnt; i++) { printf("i = %d dis = %d\n", t[i], Distance(V[t[i]].x, V[t[i]].y, 0, 0)); }
BuildGraph(); //PrintGraph();
//printf("%d\n", cnt);
for(i = 0; i < cnt; i++) {
//printf("t = %d\n", t[i]);
BFS(t[i]);
}
if(D[n] == -1) printf("0\n");
else {
printf("%d\n", D[n]);
p = P[n];
while(p != -1) {
stack[++rear] = p;
//printf("p = %d\n", p);
//printf("%d %d\n", V[p].x, V[p].y);
p = P[p];
}
while(rear) {
p = stack[rear--];
printf("%d %d\n", V[p].x, V[p].y);
}
}
there:
if(flag) printf("1\n");
return 0;
}
/*
#include <stdlib.h>
void qsort(void *base, int nelem, int width, int (*fcmp)(const void*, vonst void*));
1.待排序数组首地址
2.元素数量
3.占用空间大小
4.排序函数的指针
本题可用:
qsort(t, cnt, sizeof(t), cmp);
int cmp(const void* a, const void b) {
return dis(*(int *)a) - dis(*(int *)b);
}//距离函数dis;
*/
/*
哇讲真这道题有点水,但我又做了好久。。。。实现的也有点乱。这题主要是考察无权图的单源最短路算法。
有一点还没有想明白,它是如何更新最短路的,如何等长不更新,而更短则更新D。
如果它后来走一条路到岸,不会覆盖前一路径么?等我想通了再来改吧。。。
*/
07-图5 Saving James Bond - Hard Version (30分)
最新推荐文章于 2021-09-04 23:48:07 发布