C - Silver Cow Party

最新推荐文章于 2020-10-08 19:20:50 发布

洛阳八中我最棒

最新推荐文章于 2020-10-08 19:20:50 发布

阅读量338

点赞数

分类专栏： C/C++

本文链接：https://blog.csdn.net/weixin_44532671/article/details/92798730

版权

在N个农场中，每个农场的一只奶牛将参加在农场#X举行的聚会。存在M条单向道路连接农场，每条路需要一定时间才能通过。奶牛会选择最短路线前往和返回。问题求解所有奶牛中花费最长时间往返聚会的奶牛的时间。题目要求使用Dijkstra算法两次，避免使用Floyd因可能导致超时，并注意不要用memset初始化数组。

摘要由CSDN通过智能技术生成

One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1…N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roads connects pairs of farms; road i requires Ti (1 ≤ Ti ≤ 100) units of time to traverse.

Each cow must walk to the party and, when the party is over, return to her farm. Each cow is lazy and thus picks an optimal route with the shortest time. A cow’s return route might be different from her original route to the party since roads are one-way.

Of all the cows, what is the longest amount of time a cow must spend walking to the party and back?

Input
Line 1: Three space-separated integers, respectively: N, M, and X
Lines 2… M+1: Line i+1 describes road i with three space-separated integers: Ai, Bi, and Ti. The described road runs from farm Ai to farm Bi, requiring Ti time units to traverse.
Output
Line 1: One integer: the maximum of time any one cow must walk.
Sample Input
4 8 2
1 2 4
1 3 2
1 4 7
2 1 1
2 3 5
3 1 2
3 4 4
4 2 3
Sample Output
10
Hint
Cow 4 proceeds directly to the party (3 units) and returns via farms 1 and 3 (7 units), for a total of 10 time units.

这个题用了两次dijkstra 因为用floyd会超时
然后划重点：：：数组传递到函数中不要用memset初始化。

/*

Sample Input
4 8 2
1 2 4
1 3 2
1 4 7
2 1 1
2 3 5
3 1 2
3 4 4
4 2 3


Sample Output
10


*/ 
#include<cstdio>
#include<cstring>
#include<iostream>
#define NN 1005
using namespace std;
int dis[NN][NN];
int N,M,X;
int result=0;
int flag[NN];