文章标题 Silver Cow Party
来源:互联网 发布:windows共享文件夹 编辑:程序博客网 时间:2024/05/21 15:51
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
题意:n块地,m条路,在第k块地举行party,问从各自地到第k块地,再返回各自地最短时间中最长的时间
#include<cstdio>#include<cstring>#include<iostream>using namespace std;const int N=1009;const int inf=0x3f3f3f;int map[N][N],dis[N],diss[N],book[N];int n,m,k;void dij(){ memset(book,0,sizeof(book)); int i,j; for(i=1;i<=n;i++) dis[i]=map[k][i]; for(i=1;i<=n;i++) { int minn=inf,u; for(j=1;j<=n;j++) { if(!book[j]&&dis[j]<minn) { u=j; minn=dis[j]; } } book[u]=1; for(int v=1;v<=n;v++) { if(map[u][v]<inf) { dis[v]=min(dis[v],dis[u]+map[u][v]); } } }}int main(){ while(~scanf("%d%d%d",&n,&m,&k)) { int i,j; for(i=1;i<=n;i++) for(j=1;j<=n;j++) if(i==j) map[i][j]=0; else map[i][j]=inf; int a,b,c; for(i=1;i<=m;i++) { scanf("%d%d%d",&a,&b,&c); map[a][b]=c; } dij(); for(i=1;i<=n;i++) diss[i]=dis[i]; int t; for(i=1;i<=n;i++) { for(j=i+1;j<=n;j++) { t=map[i][j]; map[i][j]=map[j][i]; map[j][i]=t; } } dij(); int maxn=0; for(i=1;i<=n;i++) { maxn=max((dis[i]+diss[i]),maxn); } printf("%d\n",maxn); }}
- 文章标题 Silver Cow Party
- 文章标题 POJ 3268 : Silver Cow Party (最短路--spfa)
- Silver Cow Party
- POJ3268:Silver Cow Party
- poj3268 - Silver Cow Party
- POJ3268 Silver Cow Party
- POJ3268 Silver Cow Party
- Silver Cow Party
- poj_3268 Silver Cow Party
- POJ3268 Silver Cow Party
- K - Silver Cow Party
- poj3268-Silver Cow Party
- Silver Cow Party
- Silver Cow Party
- Silver Cow Party
- poj Silver Cow Party
- POJ3268-Silver Cow Party
- poj Silver Cow Party
- PAT L1-033. 出生年
- ONGL表达式在jsp中获取各种数据的方法
- 大话设计模式读书笔记(十五) 备忘录模式
- 1062. 最简分数(20)
- Windows系统功能模拟 C++(EasyX插件)—— 8th 窗口(二)
- 文章标题 Silver Cow Party
- 笔记本外接显示器设置全屏壁纸
- linux中的atexit
- java byte/char/string/int之间的转化
- Android之如何让Android studio编译更快
- 2017.4.19 细胞分裂 思考记录
- IIC学习
- 解决Jupyter notebook[import tensorflow as tf]报错
- Android基础系列