pat甲级1072 Gas Station (30分) floyd or dijkstra

A1072

经验教训

1. 审题存在很大问题：没有注意到gas station和house不是一个数量级的，使用floyd算法最后一个测试点会超时。而且对于择优条件的审查经常出错，本题在所有方案的最近house距离中选择最大的那个方案，若相同选择到所有房屋距离最短的那个，若相同选择下标最小的那个。
2. floyd算法的d[][]初始化。自己到自己是0，若两点有边则初始化为边长，其余为无穷大。无需用g[][]存边。
3. atoi()将字符数组转化为数字。
4. 题目给的例子中平均距离是经过了四舍五入的（3.25–>3.3）但是测试数据是不用四舍五入，白花了我一个多小时找bug（无语）。

floyd

#include <bits/stdc++.h>
using namespace std;

const int N = 1020, M = 15, K = 10010, inf = 0x3f3f3f3f;
int n, m, road, range, total;
int d[N][N];

int transefer(char a[]){
	if(*a != 'G') return atoi(a); 
	else return atoi(a+1) + n;
}

bool check(int gas, int& tmin, int& tsum){
	for(int i = 1; i <= n; i++){
		if(d[gas][i] > range) return false;
		tsum += d[gas][i];
		if(d[gas][i] < tmin) tmin = d[gas][i];
	}
	return true;
}

int main(){
	memset(d, 0x3f, sizeof d);
	cin >> n >> m >> road >> range;
	total = n + m;
	for(int i =1; i <= total; i++){
		d[i][i] = 0;
	}
	char p1[6], p2[6];
	int  dist, c1, c2;
	for(int i =0; i < road; i ++){
		scanf("%s%s%d", p1, p2, &dist);
		c1 = transefer(p1);
		c2 = transefer(p2);
		d[c1][c2] = d[c2][c1] = dist;
	}

	for(int k = 1; k <= total; k ++){
		for(int i = 1; i <= total; i ++){
			for(int j = 1; j <= total; j ++){
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
			}
		}
	}
	
	
	int id = -1, Min = 0, Sum = inf;
	for(int i = n+1; i <= total; i ++){
		int tsum = 0, tmin = inf;
		if(check(i, tmin, tsum)){
            if(tmin > Min){
                id = i;
			    Sum = tsum;
			    Min = tmin;
            }else if(tmin == Min && tsum < Sum){
                id = i;
			    Sum = tsum;
            }
			
		}
	}
	if(id == -1) printf("No Solution");
	else{
		printf("G%d\n", id-n);
		float avg = Sum*1.0/n; 
		printf("%.1f %.1f", Min*1.0, avg);
	}
	return 0;
}

dijkstra

#include <bits/stdc++.h>
using namespace std;

const int N = 1020, M = 15, K = 10010, inf = 0x3f3f3f3f;
int n, m, road, range, total;
int g[N][N], d[N];
bool st[N];

int transefer(char a[]){
	if(*a != 'G') return atoi(a); 
	else return atoi(a+1) + n;
}

bool check(int gas, int& tmin, int& tsum){
	for(int i = 1; i <= n; i++){
		if(d[i] > range) return false;
		tsum += d[i];
		if(d[i] < tmin) tmin = d[i];
	}
	return true;
}

void dijkstra(int u){
	memset(d, 0x3f, sizeof d);
	memset(st, false, sizeof st);
	d[u] = 0;
	
	while(true){
		int v = -1;
		for(int i = 1; i <= total; i ++){
			if(!st[i] && (v == -1 || d[v] > d[i]))
				v = i;
		}
		
		if(v == -1) break;
		st[v] = true;
		
		for(int i = 1; i <= total; i ++)
			d[i] = min(d[i], d[v] + g[v][i]);
	}
	
	return ;
}

int main(){
	memset(g, 0x3f, sizeof g);
	cin >> n >> m >> road >> range;
	total = n + m;
	char p1[6], p2[6];
	int  dist, c1, c2;
	for(int i =0; i < road; i ++){
		scanf("%s%s%d", p1, p2, &dist);
		c1 = transefer(p1);
		c2 = transefer(p2);
		g[c1][c2] = g[c2][c1] = dist;
	}
	
	int id = -1, Min = 0, Sum = inf;
	for(int i = n+1; i <= total; i ++){
		dijkstra(i);
		
		int tmin = inf, tsum = 0;
		if(check(i, tmin, tsum)){
            if(tmin > Min){
                id = i;
			    Sum = tsum;
			    Min = tmin;
            }else if(tmin == Min && tsum < Sum){
                id = i;
			    Sum = tsum;
            }
		}
	}
	
	if(id == -1) printf("No Solution");
	else{
		printf("G%d\n", id-n);
		double avg = Sum * 1.0 / n ; 
		printf("%.1f %.1f", Min*1.0, avg);
	}
	return 0;
}