Silver Cow Party POJ
来源:互联网 发布:Python如何使用 编辑:程序博客网 时间:2024/05/21 09:49
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 requiresTi (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?
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.
4 8 21 2 41 3 21 4 72 1 12 3 53 1 23 4 44 2 3
10
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.
单元最短路:
spfa
#include <iostream>#include<stdio.h>#include<cstdio>#include<iostream>#include<algorithm>#include<math.h>#include<string.h>#include<map>#include<queue>#include<vector>#include<deque>#define ll long long#define inf 0x3f3f3f3f#define mem(a,b) memset(a,b,sizeof(a))using namespace std;int n,dis[1001],vis[1001],mp[1001][1001][3],x;int m,ans[1001];vector<int>p[1001];void spfa(int temp){ queue<int>que; mem(vis,0); for(int i=1; i<=n; i++) { dis[i]=inf; } while(!que.empty())que.pop(); vis[x]=1; dis[x]=0; que.push(x); while(!que.empty()) { int u=que.front(); que.pop(); vis[u]=0; for(int i=1; i<=n; i++) { int w=mp[u][i][temp]; if(dis[i]>dis[u]+w) { dis[i]=dis[u]+w; if(vis[i]==0) { vis[i]=1; que.push(i); } } } } for(int i=1; i<=n; i++) { ans[i]+=dis[i]; }}int main(){ while(~scanf("%d%d%d",&n,&m,&x)) { mem(mp,inf); int v,u,t; for(int i=0; i<m; i++) { scanf("%d%d%d",&u,&v,&t); if(mp[u][v][0]>t) mp[u][v][0]=t; if(mp[v][u][1]>t) mp[v][u][1]=t; } mem(ans,0); spfa(0); spfa(1); int maxx=0; for(int i=1; i<=n; i++) { maxx=max(maxx,ans[i]); } printf("%d\n",maxx); }}
- poj Silver Cow Party
- poj Silver Cow Party
- Silver Cow Party POJ
- Silver Cow Party POJ
- Silver Cow Party POJ
- Silver Cow Party POJ
- POJ Silver Cow Party
- Silver Cow Party POJ
- Silver Cow Party POJ
- poj 3268 Silver Cow Party
- POJ 3268 Silver Cow Party
- poj 3268 Silver Cow Party
- POJ 3268 Silver Cow Party
- POJ 3268 Silver Cow Party
- POJ-3268-Silver Cow Party
- poj 3268 Silver Cow Party
- poj 3268 Silver Cow Party
- POJ-3268-Silver Cow Party
- 内存一致性模型(Memory Consistency Models)
- github 将本地项目提交到仓库中(二)
- CDH 基本环境安装脚本
- 小姑娘的一句话,让90%的销售都惭愧了
- 网易前端实习生面试
- Silver Cow Party POJ
- OpenCV 几何变换-图像镜像
- csdn发表博客时出现"选择文章类型”
- 排序
- JavaScript面向对象(二)--前端必须知道的原型和继承
- js中的兼容问题
- 订阅号如何获取用户基本信息?
- WPS为公式编号
- 生成随机数