1072. 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 51 2 21 4 21 G1 41 G2 32 3 22 G2 13 4 23 G3 24 G1 3G2 G1 1G3 G2 2
Sample Output 1:
G12.0 3.3
Sample Input 2:
2 1 2 101 G1 92 G1 20
Sample Output 2:
No Solution
N个城市，M个站点， K条路，天然气站点能辐射范围最远DS；
（K行）城市或站点  城市或站点  距离；
……

PS其中城市编号1~N；站点G~GM；
目标求某一站点符合要求（越前面的条件越重要） 必须：所有的城市都在等于辐射范围或以内；
                                                                         多个必须，那么附加：在这些站点中  取（每个城市到站点的最小距离）最长的那个站点；
                                                                         多个必须并最小距离相等，那么附加：在这些站点中，取到各个城市【总距离最短】的站点；
                                                                         符合必须，并最小距离相等并总距离相等，取编号小的站点；
简单的说就是，在能够提供服务的前提下（职能问题）
                            站点到城市的最小距离越大越好，（环境或危险性问题）
                                    站点到各个城市的距离总和越少越好（浪费问题）
                                            编号选择小的(答案唯一问题)

熬夜找了好久的错误，发现错误认为char c[3]可以符合，但是G10，100也是存在的
评测结果
时间结果得分题目语言用时(ms)内存(kB)用户8月15日 01:51答案正确301072C++ (g++ 4.7.2)13692datrilla
测试点
测试点结果用时(ms)内存(kB)得分/满分0答案正确118016/161答案正确13082/22答案正确13084/43答案正确13084/44答案正确136924/4

#include<iostream> #include<vector>#include<iomanip>#include<string>#include<queue> using namespace std;   int returnIndex(string *c,int N){  int num;  if ((*c)[0] == 'G')  {    sscanf(&(*c)[1], "%d", &num);    num += N;  }  else  sscanf(&(*c)[0], "%d",&num);   return num;}void readln(vector<vector<pair<int,int>>>*Roads, int N,int K){  string p1,p2;  int dist;  while (K--)  {    cin >> p1 >> p2 >> dist;     (*Roads)[returnIndex(&p1, N)].push_back(make_pair(returnIndex(&p2, N), dist));    (*Roads)[returnIndex(&p2, N)].push_back(make_pair(returnIndex(&p1, N),dist));    }}bool spfa_BFS(vector<vector<pair<int,int>>>*Roads, int nowStation, int DS, double*nowmin, double *nowave,int M,int N){  vector<int>Dist(M);  vector<bool>InSet(M,false);  vector<bool>DistExit(M, false);  Dist[nowStation] = 0;  DistExit[nowStation] = true;  InSet[nowStation] = true;  queue<int>QD;  QD.push(nowStation);  int temp;  while (!QD.empty())  {    temp = QD.front();    QD.pop();     InSet[temp] = false;    for (vector<pair<int,int>>::iterator iter=(*Roads)[temp].begin(); iter!= (*Roads)[temp].end(); iter++)    {      if (!DistExit[iter->first] || DistExit[iter->first] && Dist[iter->first] > Dist[temp] + iter->second)      {        Dist[iter->first] = Dist[temp] + iter->second;        if (!InSet[iter->first])        {          QD.push(iter->first);          InSet[iter->first] = true;        }        DistExit[iter->first] = true;       }    }  }/*Roads相当于GMAP就是数组邻接表，这里是用BFS求所有的house到nowStaion最短的路径。   InSet说明已经在队伍中当做与nowStaion最近的用过。DistExit标记是否可达*/  (*nowave) = 0;  for (temp = 1; temp <= N; temp++)  {    if (!DistExit[temp] || Dist[temp] > DS)return false;    else     {      if ((*nowave) == 0)        (*nowmin) = Dist[temp];      else if ((*nowmin) > Dist[temp])(*nowmin) = Dist[temp];      (*nowave) += Dist[temp];    }  }  return true;}int main(){  int N, M, K, DS, anStation,nowStation;  double minnum, average,nowmin,nowave;  bool first;  cin >> N >> M >> K >> DS;  vector<vector<pair<int,int>>>Roads(N+M+1);    readln(&Roads, N, K);  first = true;  M = N + M + 1;    for (nowStation = N + 1; nowStation < M; nowStation++)  {    if (spfa_BFS(&Roads, nowStation, DS, &nowmin, &nowave, M, N))    {      if (first || !first&&minnum<nowmin ||!first&&minnum == nowmin&&average>nowave)      {        anStation = nowStation;        minnum = nowmin;          average = nowave;          first = false;      }    }   }  if (first)cout << "No Solution" << endl;  else   {    cout << "G" << anStation - N << endl;     cout << setiosflags(ios::fixed) << setprecision(1) << minnum << " "    << setiosflags(ios::fixed) << setprecision(1) << average / N << endl;  }    system("pause");  return 0;}