HDU 4435 charge-station bfs图论问题

E - charge-station

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 4435

Appoint description:

Description

There are n cities in M^3's empire. M^3 owns a palace and a car and the palace resides in city 1. One day, she wants to travel around all the cities from her palace and finally back to her home. However, her car has limited energy and can only travel by no more than D meters. Before it was run out of energy, it should be charged in some oil station. Under M^3's despotic power, the judge is forced to build several oil stations in some of the cities. The judge must build an oil station in city 1 and building other oil stations is up to his choice as long as M^3 can successfully travel around all the cities.
Building an oil station in city i will cost 2 ^i-1 MMMB. Please help the judge calculate out the minimum cost to build the oil stations in order to fulfill M^3's will.

 

Input

There are several test cases (no more than 50), each case begin with two integer N, D (the number of cities and the maximum distance the car can run after charged, 0 < N ≤ 128).
Then follows N lines and line i will contain two numbers x, y(0 ≤ x, y ≤ 1000), indicating the coordinate of city i.
The distance between city i and city j will be ceil(sqrt((xi - xj) ² + (yi - yj) ²)). (ceil means rounding the number up, e.g. ceil(4.1) = 5)

 

Output

For each case, output the minimum cost to build the oil stations in the binary form without leading zeros.
If it's impossible to visit all the cities even after all oil stations are build, output -1 instead.

 

Sample Input

3 3 0 0 0 3 0 1 3 2 0 0 0 3 0 1 3 1 0 0 0 3 0 1 16 23 30 40 37 52 49 49 52 64 31 62 52 33 42 41 52 41 57 58 62 42 42 57 27 68 43 67 58 48 58 27 37 69

 

Sample Output

11 111 -1 10111011

Hint

 In case 1, the judge should select (0, 0) and (0, 3) as the oil station which result in the visiting route: 1->3->2->3->1. And the cost is 2^(1-1) + 2^(2-1) = 3.
大概提议就是给出n和d，下面分别给出n个点的坐标，汽车一次加油可以行使长度为d的距离。但是中途可以加油，问在哪些地方加油可以使得汽车行使完整个来回路程，并且要求建立加油站花费的金额最小，
输出就是二进制判断，1为建立，0为不建立

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<queue>
#include<math.h>
#include<algorithm>
using namespace std;
const int maxn=150;
const int inf=999999999;
int map[maxn][maxn];
int n,d;
double x[maxn],y[maxn];
int dis[maxn];
bool vis[maxn];

int ans[maxn];

int check(){
      memset(vis,false,sizeof(vis));
      for(int i=1;i<=n;i++){
          if(ans[i])
              dis[i]=0;
          else
              dis[i]=inf;
      }
      queue<int>que;
    que.push(1);
    vis[1]=true;
    while(!que.empty()){
       int u=que.front();
          que.pop();
          for(int i=1;i<=n;i++){
              if(!vis[i]&&map[u][i]<=d){
                   dis[i]=min(dis[i],dis[u]+map[u][i]);
                   if(ans[i]){
                       vis[i]=true;
                       que.push(i);
                   }
              }
          }          
    }
    for(int i=1;i<=n;i++){
       if(ans[i]==1&&!vis[i])
           return false;
       else if(ans[i]==0&&dis[i]*2>d)
           return false;
    }
  return true;
       
}

int main(){
       while(scanf("%d%d",&n,&d)!=EOF){
             memset(map,0,sizeof(map));
             for(int i=1;i<=n;i++){
                 scanf("%lf%lf",&x[i],&y[i]);
             }
             for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++){
                    map[i][j]=ceil(sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])));
                }
             }
             for(int i=1;i<=n;i++){
                ans[i]=1;
             }
              if(!check()){
                 printf("-1
");
                continue; 
              }

              for(int i=n;i>=1;i--){
                  ans[i]=0;
                  if(!check())
                      ans[i]=1;
              }
            int i;
        for( i=n;i>=1;i--){
            if(ans[i]==1)
                break;
        }
        for(int j=i;j>=1;j--)
            printf("%d",ans[j]);
        printf("
");
       }
       return 0;
}