poj 3268 Silver Cow Party

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

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.

Source

USACO 2007 February Silver

/*Problem: 3268  User: saruka Memory: 8272K  Time: 63MS Language: G++  Result: Accepted */#include<cstdio>const int maxn = 1005;const int INF = 1009999999;int map1[maxn][maxn], map2[maxn][maxn];int dis1[maxn], dis2[maxn];int n, line;void dijkstra(int v,int dis[],int map[][maxn]){    int s[maxn];    int i, j;    for(i = 1; i <= n; i++)    {        dis[i] = map[v][i];        s[i] = 0;    }    s[v] = 1;    dis[v] = INF;    for(i = 1; i <= n; i++)    {        int min = INF, u = v;        for(j = 1; j <= n; j++)        {            if(!s[j] && dis[j] < min)            {                min = dis[j];                u = j;            }        }        s[u] = 1;        for(j = 1; j <= n; j++)        {            int new_dis = dis[u] + map[u][j];            if(dis[j] > new_dis && !s[j])            {                dis[j] = new_dis;            }        }    }}int main(){    int i, j, place;    int a, b, c, max = 0;    scanf("%d%d%d", &n, &line, &place);    for(i = 1; i <= n; i++)    {        for(j = 1; j <= n; j++)        {            map1[i][j] = INF;            map2[i][j] = INF;        }    }    for(i = 1; i <= line; i++)    {        scanf("%d%d%d", &a, &b, &c);        if(a == place) map2[a][b] = c;        if(b == place) map1[b][a] = c;        else        {            map1[b][a] = c;            map2[a][b] = c;        }    }    dijkstra(place, dis1, map1);    dijkstra(place, dis2, map2);    for(i = 1; i <= n; i++)    {        if(dis1[i] + dis2[i] > max && dis1[i] != INF && dis2[i] != INF)        {            max = dis1[i] + dis2[i];        }    }    printf("%d\n", max);    return 0; }

Powered By Saruka.
Copyright © 2016 All Rights Reserved.