1072. Gas Station (30)

1. Gas Station (30)
   时间限制
   200 ms
   内存限制
   65536 kB
   代码长度限制
   16000 B
   判题程序
   Standard
   作者
   CHEN, Yue

A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as possible. However it must guarantee that all the houses are in its service range.

Now given the map of the city and several candidate locations for the gas station, you are supposed to give the best recommendation. If there are more than one solution, output the one with the smallest average distance to all the houses. If such a solution is still not unique, output the one with the smallest index number.

Input Specification:

Each input file contains one test case. For each case, the first line contains 4 positive integers: N (<= 103), the total number of houses; M (<= 10), the total number of the candidate locations for the gas stations; K (<= 104), the number of roads connecting the houses and the gas stations; and DS, the maximum service range of the gas station. It is hence assumed that all the houses are numbered from 1 to N, and all the candidate locations are numbered from G1 to GM.

Then K lines follow, each describes a road in the format
P1 P2 Dist
where P1 and P2 are the two ends of a road which can be either house numbers or gas station numbers, and Dist is the integer length of the road.

Output Specification:

For each test case, print in the first line the index number of the best location. In the next line, print the minimum and the average distances between the solution and all the houses. The numbers in a line must be separated by a space and be accurate up to 1 decimal place. If the solution does not exist, simply output “No Solution”.
Sample Input 1:

4 3 11 5
1 2 2
1 4 2
1 G1 4
1 G2 3
2 3 2
2 G2 1
3 4 2
3 G3 2
4 G1 3
G2 G1 1
G3 G2 2

Sample Output 1:

G1
2.0 3.3

Sample Input 2:

2 1 2 10
1 G1 9
2 G1 20

Sample Output 2:

No Solution

---

这题很郁闷，犯了很多幼稚的错误，却没有发现。如排序规则出错，检索号出错，需要自我检讨下。

这题需要注意的是，每个候选点，即便没有加油站，也都是需要计入路径的。
通过这题，复习了单源最短路径的dijkstra算法。

#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<vector>
using namespace std;
const int NUM = 1020;  
const int INF = 99999999;  
int road[NUM][NUM],dist[NUM]={INF};
int n,m,k,ds;  
bool visited[NUM]={false};  
int mindist(int v);
int getindex(string p){
    int i=0,len=p.size(),ID=0;
    while(i<len){
        if(p[i]!='G'){
            ID=ID*10+p[i]-'0';
        }
        i++;
    }
    if (p[0]=='G') return n+ID;
    else return ID;
}
int mindist(){
    int i,mm=-1;
    int min=INF;
    for(i=1;i<=n+m;i++){
        if(dist[i]<min&&!visited[i]){
         mm=i;
         min=dist[i];
        }
    }
    return mm;
}
void Dis(int v){
    memset(visited,false,sizeof(visited));
    fill(dist,dist+NUM,INF);
    int i,j;
    dist[v]=0;
    while(v!=-1){
        visited[v]=true;
        for(j=1;j<=n+m;j++){
            if(!visited[j]&&dist[j]>dist[v]+road[v][j]){
                dist[j]=dist[v]+road[v][j];
            }
        }
        v=mindist();
    }
}
int main(){
    freopen("in.txt","r",stdin);
    int i;
    cin>>n>>m>>k>>ds;
    int x,y;
    fill(road[0],road[0]+NUM*NUM,INF);
    string p1,p2;
    for(i=0;i<k;i++){
        cin>>p1>>p2;
        x=getindex(p1);
        y=getindex(p2);
        cin>>road[x][y];
        road[y][x]=road[x][y];
    }    
    double ansDis=-1,ansAvg=INF;
    int ansID=-1;
    for(i=n+1;i<=n+m;i++){
        double mindis=INF,avg=0;
        Dis(i);
        for(int j=1;j<=n;j++){
            if(dist[j]>ds){
                mindis=-1;
                break;
            }
            if(dist[j]<mindis) mindis=dist[j];
            avg+=1.0*dist[j]/n;
        }
        if(mindis==-1) continue;
        if(mindis>ansDis) {
            ansID=i;
            ansDis=mindis;
            ansAvg=avg;
        }
        else if(mindis==ansDis&&avg<ansAvg){
            ansID=i;
            ansAvg=avg;
        }
    }
    if(ansID!=-1){
        printf("G%d\n%.1f %.1f\n",ansID-n,ansDis,ansAvg);
    }
    else printf("No Solution\n");
    return 0;

}