PAT (Advanced) 1003

最新推荐文章于 2020-07-06 20:53:00 发布

Jason_Wcz

最新推荐文章于 2020-07-06 20:53:00 发布

阅读量149

点赞数

分类专栏：图论 PAT

本文链接：https://blog.csdn.net/w419387229/article/details/81254753

版权

PAT 同时被 2 个专栏收录

41 篇文章 0 订阅

订阅专栏

图论

6 篇文章 0 订阅

订阅专栏

简单的图

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int map[505][505];
int teams[505];
int vis[505];
int n, m, start, endc;
int INF = 100000;
int pmin = INF, path = 0, tmax = 0;

void solve(int len, int x, int team){
	if(x == endc){
		if(len < pmin){
			pmin = len;
			path = 1;
			tmax = team;
		}
		else if(len == pmin){
			path++;
			tmax = max(team, tmax);
		}
		return;
	}
	for(int i = 0; i < n; i++){
		if(vis[i] == 0 && map[x][i] < INF && len + map[x][i] <= pmin){
			vis[i] = 1;
			
			solve(len + map[x][i], i, team+teams[i]);
			vis[i] = 0;
		}
	}
}

int main(){
	scanf("%d%d%d%d",&n,&m,&start,&endc);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++)
			map[i][j] = INF;
	}
	memset(vis, 0, n);
	for(int i = 0; i < n; i++)
		scanf("%d",&teams[i]);
	for(int i = 0; i < m; i++){
		int x, y, v;
		scanf("%d%d%d",&x,&y,&v);
		map[x][y] = map[y][x] = v;
	}
	vis[start] = 1;
	solve(0, start, teams[start]);
	printf("%d %d", path, tmax);
	return 0;
}