Silver Cow Party
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 irequires 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.
思路:
估算了一下复杂度,1e9emmmm还挺高的,刚开始没敢写,但同桌说他暴力过了..........于是,去TMD正解建反向图,暴力才是王道!除了x,其他全跑一遍,暴力瞎搞,不过洛谷的1000ms时限不加O2优化还是过不去
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1010;
const int MAXN = (int)1e5 + 10;
typedef pair<int,int> pir;
int n,m;
struct Edge
{
int to,next,val;
Edge(){}
Edge(int _to,int _next,int _val)
{
to = _to,next = _next,val = _val;
}
}edge[MAXN];
int head[maxn],top;
void init(int n)
{
memset(head,-1,sizeof(int) * (n + 1));
top = 0;
}
void add(int u,int v,int val)
{
edge[top] = Edge(v,head[u],val);
head[u] = top ++;
}
void getmap(int m)
{
int u,v,val;
while (m --)
{
scanf("%d %d %d",&u,&v,&val);
add(u,v,val);
}
}
int dis[maxn];
void djk(int st,int end)
{
memset(dis,inf,sizeof(int) * (n + 1));
priority_queue<pir,vector<pir>,greater<pir> > que;
dis[st] = 0,que.push(make_pair(0,st));
while (!que.empty())
{
pir p = que.top();
que.pop();
int v = p.second;
if (dis[v] < p.first)
continue;
for (int i = head[v]; ~i ;i = edge[i].next)
{
Edge e = edge[i];
if (dis[e.to] > dis[v] + e.val)
{
dis[e.to] = dis[v] + e.val;
que.push(make_pair(dis[e.to],e.to));
}
}
}
}
int main()
{
int x;
scanf("%d %d %d",&n,&m,&x);
init(n);
getmap(m);
int ans = 0,cnt;
for (int i = 1;i <= n;i ++)
{
if (i == x) continue;
djk(i,x);
cnt = dis[x];
if (cnt != inf)
{
djk(x,i);
if (dis[i] != inf)
ans = max(ans,cnt + dis[i]);
}
}
printf("%d\n",ans);
return 0;
}