HDU 1245 Saving James Bond

没什么意思这题，细节处理上比较麻烦，总结几点：

1、凡是给坐标多加一个范围判断，因为不知道给的坐标是不是在[-50,-50]-[50,50]的范围内。

2、建图的时候注意那些不直接相关的点，比如此题有从中间岛上直接跳出去的情况。对点进行分类，类间关系再建图。

#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>

#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>

using namespace std;

#pragma pack(4)

const double  eps = 1e-8;
const double   pi = acos(-1.0);
const int     inf = 0x7f7f7f7f;
const __int64 INF = 0x7f7f7f7f7f7f7f7fll;

#define   at(a,i) ((a)&(1<<(i)))
#define   nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))

#define gret(a,b) (((a)-(b))>eps)
#define less(a,b) (((b)-(a))>eps)
#define greq(a,b) (((a)-(b))>-eps)
#define leeq(a,b) (((b)-(a))>-eps)
#define equl(a,b) (fabs((a)-(b))<eps)

#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (gret(a,b)?(a):(b))
#define fmin(a,b) (less(a,b)?(a):(b))

const int MAXV = 1200;
const int MAXE = 120000;

struct node
{
    int v;
    double w;
}G[MAXE];
int _index,pre[MAXV],next[MAXE];

void clear(void)
{
    _index=0;
    memset(pre,-1,sizeof(pre));
}
void add(int u,int v,double w)
{
    G[_index].v=v;
    G[_index].w=w;
    next[_index]=pre[u];
    pre[u]=_index++;

    G[_index].v=u;
    G[_index].w=w;
    next[_index]=pre[v];
    pre[v]=_index++;
}

bool inQ[MAXV];
double dis[MAXV];
int Q[MAXV],path[MAXV];

double SPFA(int src,int des,int n)
{
    int u,v;
    double w;
    for(int i=0;n>i;i++)
    {
        inQ[i]=false;
        dis[i]=path[i]=inf;
    }
    Q[0]=src;
    dis[src]=path[src]=0;

    for(int f=0,r=1;f!=r;f=(f+1)%MAXV)
    {
        inQ[u=Q[f]]=false;
        for(int i=pre[u];i!=-1;i=next[i])
        {
            v=G[i].v;
            w=G[i].w;
            if(gret(dis[v],dis[u]+w))
            {
                dis[v]=dis[u]+w;
                path[v]=path[u]+1;
                if(!inQ[v])
                {
                    inQ[Q[r]=v]=true;
                    r=(r+1)%MAXV;
                }
            }
        }
    }

    return dis[des];
}

double len(double x1,double y1,double x2,double y2)
{
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
bool within(double x,double y)
{
    return leeq(7.5,len(x,y,0,0))&&leeq(fabs(x),50)&&leeq(fabs(y),50);
}

int n;
double d,x[MAXV],y[MAXV];

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("Saving James Bond.txt","r",stdin);
    #endif

    while(scanf("%d %lf",&n,&d)!=EOF)
    {
        clear();
        for(int i=1;n>=i;i++)
        {
            scanf("%lf %lf",&x[i],&y[i]);
        }
        if(greq(d,50-7.5)) add(0,n+1,50-7.5);
        else
        {
            for(int i=1;n>=i;i++)
            {
                if(within(x[i],y[i]))
                {
                    for(int j=1;n>=j;j++)
                    {
                        if(within(x[j],y[j]))
                        {
                            if(i!=j&&leeq(len(x[i],y[i],x[j],y[j]),d))
                            {
                                add(i,j,len(x[i],y[i],x[j],y[j]));
                            }
                        }
                    }
                    if(leeq(50-fabs(x[i]),d)) add(i,n+1,50-fabs(x[i]));
                    if(leeq(50-fabs(y[i]),d)) add(i,n+1,50-fabs(y[i]));
                    if(leeq(len(x[i],y[i],0,0)-7.5,d)) add(0,i,len(x[i],y[i],0,0)-7.5);
                }
            }
        }
        if(equl(SPFA(0,n+1,n+2),inf)) printf("can't be saved\n");
        else printf("%.2lf %d\n",dis[n+1],path[n+1]);
    }
    return 0;
}