1030 Travel Plan (30分)（俺是个粗人）

就保存所有的路径，找出最短最便宜的叭

#include<iostream>
#include<vector>
#include<limits.h>
using namespace std;
struct node
{
int distance;
int cost;
};
int num,roads,c,des;
node map[501][501];
bool vis[501] = {false};
vector<vector<int>> road;
vector<int> path;

void DFS(int c,vector<int> & path){
path.push_back(c);
vis[c] = true;
if (c == des)
{
road.push_back(path);
path.pop_back();
vis[c] = false;
return;
}

for (int i = 0; i < num; ++i)
{
if(vis[i]==false&&map[c][i].distance!=0)
DFS(i, path);
}
path.pop_back();
vis[c] = false;
}
int main(){

node k;
k.cost = 0;
k.distance = 0;
fill(map[0], map[0] + 500 * 500, k);
cin >> num >> roads >> c >> des;
for (int i = 0; i < roads;++i){
int a, b, c, d;
cin >> a >> b >> c >> d;
map[a][b].distance = c;
map[a][b].cost = d;
map[b][a].distance = c;
map[b][a].cost = d;
}
DFS(c, path);
vector<int> res;
int mark = 99999999;
int mincost;
for (int i = 0; i < road.size();++i){
int sum = 0,cost=0;
for (int j = 1; j < road[i].size();++j){
sum += map[road[i][j - 1]][road[i][j]].distance;
cost += map[road[i][j - 1]][road[i][j]].cost;
}
if(sum<mark){
mark = sum;
mincost = cost;
res = road[i];
}
if(sum==mark){
if(cost<mincost)
mincost=cost, res = road[i];
}

}
for (int i = 0; i < res.size();++i){
cout << res[i] << " ";
}
cout << mark << " " << mincost;
}

1030 Travel Plan (30分)（俺是个粗人）相关推荐

PAT甲级1030 Travel Plan (30分)：[C++题解]dijkstra求单源最短路、保存路径
文章目录题目分析题目链接题目分析来源:PAT网站分析 dijkstra模板默写过来,然后多了一个保存路径,使用数组pre[N]记录最短路上每个点的前驱,通过pre数组保存到vector中 v ...
【PAT】【spfa + dfs】1030 Travel Plan (30 分)
题目链接:1030 Travel Plan (30 分) A traveler's map gives the distances between cities along the highways, ...
【讲解】1030 Travel Plan (30 分)【DFS】_41行代码Ac
立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 A traveler's map gives the distances between cities along the hig ...
1030 Travel Plan (30 分)
题目链接: PTA | 程序设计类实验辅助教学平台千名教师建设,万道高质量题目,百万用户拼题的程序设计实验辅助教学平台https://pintia.cn/problem-sets/9948053427 ...
1030 Travel Plan (30 分) 【难度: 中 / 知识点: 最短路】
https://pintia.cn/problem-sets/994805342720868352/problems/994805464397627392 先跑一下Dijkstra() 然后再dfs( ...
1030 Travel Plan(甲级)
1030 Travel Plan (30分) A traveler's map gives the distances between cities along the highways, toget ...
PAT甲级 1030 Travel Plan
PAT甲级 1030 Travel Plan 题目链接 A traveler's map gives the distances between cities along the highways, ...
1030 Travel Plan（超级无敌详细注释+47行代码）
分数 30 全屏浏览题目切换布局作者 CHEN, Yue 单位浙江大学 A traveler's map gives the distances between cities along the ...
2020PAT甲级秋季7-4 Professional Ability Test (30分)
7-4Professional Ability Test(30分) Professional Ability Test (PAT) consists of several series of subj ...

1030 Travel Plan (30分)（俺是个粗人）

1030 Travel Plan (30分)（俺是个粗人）相关推荐

最新文章

热门文章