Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 17213 | Accepted: 7861 |
Description
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
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
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
奶牛派对:有分别来自 N 个农场的 N 头牛去农场 X 嗨皮,农场间由 M 条有向路径连接。每头牛来回都挑最短的路走,求它们走的路的最大长度?
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;
int N, M, X;
struct node
{
int to;
int w;
}t;
vector<node>map[1005];
vector<node>rmap[1005];
int dist[1005];
int rdist[1005];
bool vis[1005];
void dijkstra()
{
int i, j, f, min;
memset(dist, 0x3f, sizeof(dist));
memset(vis, false, sizeof(vis));
dist[X] = 0;
for(i = 1; i <= N; i++)
{
f = -1;
min = 0x3f3f3f3f;
for(j = 1; j <= N; j++)
if(!vis[j] && min > dist[j])
min = dist[f = j];
if(f == -1) break;
vis[f] = true;
for(j = 0; j < map[f].size(); j++)
if(!vis[map[f][j].to] && dist[f] + map[f][j].w < dist[map[f][j].to])
dist[map[f][j].to] = dist[f] + map[f][j].w;
}
}
int main()
{
int i, A, B, T, max;
while(scanf("%d%d%d", &N, &M, &X) != EOF)
{
for(i = 1; i <= M; i++)
{
scanf("%d%d%d", &A, &B, &T);
t.w = T;
t.to = B;
map[A].push_back(t);
t.to = A;
rmap[B].push_back(t);
}
dijkstra();
memcpy(rdist, dist, sizeof(dist));
for(i = 1; i <= N; i++)
map[i] = rmap[i];
dijkstra();
for(i = 1; i <= N; i++)
dist[i] += rdist[i];
max = 0;
for(i = 1; i <= N; i++)
if(dist[i] < 0x3f3f3f3f && dist[i] > max)
max = dist[i];
printf("%d\n", max);
for(i = 1; i <= N; i++)
{
map[i].clear();
rmap[i].clear();
}
}
return 0;
}