uva 10610

SPFA

//====================================================================||
//                        Name  : Gopher and Hawks.cpp                             ||
//                     Date : 2013/5/21 下午11:58:55                         ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 1050
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int v,m;
int n;
int dis[M];
struct hole_s{
    double x,y;
}hole[M];
struct node{
    int id;
    int nowt;
    bool operator<(const node &data) const{
        return nowt>data.nowt;
    }
    node(int id,int nowt):id(id),nowt(nowt){};
};

vector<int> mz[M];
double dist(int i,int j){
    return sqrt((hole[i].x-hole[j].x)*(hole[i].x-hole[j].x)+(hole[i].y-hole[j].y)*(hole[i].y-hole[j].y));
}

void solve(){
    fill(&dis[0],&dis[M-1],oo);
    priority_queue<node> pq;
    bool inqueue[M];
    Set(inqueue,0);
    pq.push(node(0,0));
    inqueue[0]=1;
    dis[0]=0;
    while(!pq.empty()){
        int now=pq.top().id;pq.pop();
        if(now==1)break;
        inqueue[now]=0;
        FOR(it,mz[now]){
            int to=*it;
            if(dis[now]+1<dis[to]){
                dis[to]=dis[now]+1;
                if(!inqueue[to]){
                    pq.push(node(to,dis[to]));
                    inqueue[to]=1;
                }
            }

        }
    }
    if(dis[1]!=oo)printf("Yes, visiting %d other holes.\n",dis[1]-1);
    else printf("No.\n");
}
int main() {
    ios_base::sync_with_stdio(0);
    while(~scanf("%d%d%*c",&v,&m)&&v+m){

        char str[100];
        n=0;
        while(gets(str)){
            if(strcmp(str," ") == 0 ||strcmp(str,"") == 0)break;
            sscanf(str,"%lf%lf",&hole[n].x,&hole[n].y);
            n++;
        }
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                if(m*60*v>=dist(i,j)){
                    mz[i].PB(j);
                    mz[j].PB(i);
                }
            }
        }
        solve();
        for(int i=0;i<=n;i++){
            mz[i].clear();
        }

    }

















}