A1072
个人思路
对每个加油站做Dijkstra,最后对比每个加油站找到最短距离最大的值,并计算最短距离的平均值
也遇到了几个细节问题,找了好长时间
- 数组大小:要考虑所有顶点数量和加油站数量,数组大小要开到1010以上
- 节点的循环次数也要算上加油站的次数,因为存在以其他加油站为中介通往其他居民房
- 匪夷所思的点,卡了好久:求平均值出现了问题,见下面代码
此处返回result会出现平均值计算错误
double getAverage()
{
double sum = 0, result = 0;
for(int i = 1; i <= N; ++i)
sum += d[i] * 1.0;
result = sum / N * 1.0;
return result;
}
在加和过程中运算,返回sum,结果正确
double getAverage()
{
double sum = 0, result = 0;
for(int i = 1; i <= N; ++i)
sum += d[i] * 1.0 / N;
return sum;
}
难道是因为加和过程中,数太大溢出了???不明白
看来最保险的方法还是边加边求平均值
个人思路代码
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1015;
const int inf = 0x3fffffff;
int N, M, K, D;
struct Node{
int v;
int dist;
Node(){}
Node(int vv, int dd)
{
v = vv;
dist = dd;
}
}node;
vector<Node> G[maxn];
vector<int> station;
bool hashtable[maxn];//GN是否加入到station中
int d[maxn];
bool vis[maxn];
int str2int(char str[])
{
int result = 0;
if(str[0] != 'G')
{
sscanf(str, "%d", &result);
}
else
{
int len = strlen(str);
if(len < 3)
result = N + str[1] - '0';
else
result = N + 10;
if(!hashtable[result])//防止重复进入vector
{
station.push_back(result);
hashtable[result] = true;
}
}
return result;
}
void Dijkstra(int s)
{
int len = station.size();
for(int i = 0; i < N + len; ++i)
{
int u, udist, mindist = inf;
for(int j = 1; j <= N + len; ++j)
{
if(!vis[j] && d[j] < mindist)
{
u = j;
udist = mindist = d[j];
}
}
vis[u] = true;
for(int k = 0; k < G[u].size(); ++k)
{
int v = G[u][k].v;
int vdist = G[u][k].dist;
if(!vis[v])
{
if(udist + vdist < d[v])
{
d[v] = udist + vdist;
}
}
}
}
}
double getAverage()
{
double sum = 0, result = 0;
for(int i = 1; i <= N; ++i)
sum += d[i];
result = sum / N * 1.0;
return result;
}
int main() {
scanf("%d%d%d%d", &N, &M, &K, &D);
for(int i = 0; i < K; ++i)
{
char p1[10], p2[10];
int w;
scanf("%s %s %d", p1, p2, &w);
int u, v;
u = str2int(p1);
v = str2int(p2);
G[u].push_back(Node(v, w));
G[v].push_back(Node(u, w));
}
int len = station.size();
bool flag = false;//标记是否有解
int optdist = -1;//最佳距离optmindist,辅助寻找最短距离mindist
int optIndex;//最佳距离的下标
double optaver;//最佳平均值
for(int i = 0; i < len; ++i)
{
double mindist = inf, aver = 0;
int start = station[i];
fill(d, d + maxn, inf);
memset(vis, false, sizeof(vis));
d[start] = 0;
Dijkstra(start);//得到从源点到所有点的最短距离
//********作比较
bool isValid = true;//标记是否在有效范围内
for(int j = 1; j <= N; ++j)//寻找最短路径的最小值mindist
{
/*if(j == i)//源点本身 !!!i不是顶点,是加油站
continue;*/
if(d[j] > D)//有房屋不在范围内
{
isValid = false;
break;
}
if(d[j] < mindist)
mindist = d[j];
aver += 1.0 * d[j] / N;//此处重新写了一遍aver
}
if(!isValid)//有房屋不在范围内
continue;
flag = true;//此源点有效,此题有解
if(mindist > optdist)//比较出最大的mindist
{
optIndex = start;
optdist = mindist;
optaver = aver;//计算平均值
}
else if(mindist == optdist && aver < optaver)
{
optIndex = start;
optaver = aver;
}
}
if(flag)
{
printf("G%d\n", optIndex - N);
printf("%.1f %.1f", optdist * 1.0, optaver);
}
else
printf("No Solution");
return 0;
}