PAT 1003. Emergency (25)

最新推荐文章于 2021-03-01 22:14:23 发布

uiuiui_what

最新推荐文章于 2021-03-01 22:14:23 发布

阅读量261

点赞数

分类专栏：原创 PAT

本文链接：https://blog.csdn.net/u012443276/article/details/40582775

版权

原创同时被 2 个专栏收录

38 篇文章 0 订阅

订阅专栏

PAT

37 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<vector>
using namespace std;
int n, m, C1, C2;
vector<int> team, path;
int road[501][501] = { 0 };//如果为0是该两点间没有路
int len = 0;
int vst[501] = { 0 };
int helpers = 0, minpath = -1, cnt = 0, maxhelpers = 0;
void dfs(int v){
	vst[v] = 1;
	if (v == C2)
	{
//		path.push_back(v);
		len = 0;
		helpers = team[C1];
		for (int i = 0; i < path.size() - 1;){
			int c1 = path[i], c2 = path[++i];
			len += road[c1][c2];
			helpers += team[c2];
		}
		if (minpath == -1)	{
			minpath = len; maxhelpers = helpers;
			cnt = 1;
		}
		else if (len < minpath){
			minpath = len; cnt = 1; maxhelpers = helpers;
		}
		else if (len == minpath){
			cnt++; 
			if (maxhelpers < helpers)		
				maxhelpers = helpers;
		}
		return;
	}
	else{
		for (int i = 0; i < n; i++){
			if (!vst[i] && road[v][i] != 0){
				path.push_back(i);
				dfs(i);
				path.pop_back();
				vst[i] = 0;
			}
		}
	}
	return;
}
int main(){
	cin >> n >> m >> C1 >> C2;
	for (int i = 0; i < n; i++){
		int person; cin >> person;
		team.push_back(person);
	}
	for (int i = 0; i < m; i++){
		int c1, c2, l; cin >> c1 >> c2 >> l;
		road[c1][c2] = road[c2][c1] = l;
	}
	path.push_back(C1);
	dfs(C1);
	cout << cnt << " " << maxhelpers;
}