BZOJ 1631==USACO 2007== POJ 3268 Cow Party奶牛派对
2016-09-17 09:47
288 查看
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 19226 | Accepted: 8775 |
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.
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int map[1001][1001],w[1001][1001]; int dis[1001],Team[5000]; bool exist[1001]; int n,m,t; // exist 为 true 则不可进队 void SPFA(int s) { int head=0,tail=1,k=0; Team[head]=s,exist[s]=true;dis[s]=0; while(head<tail) { k=Team[head]; exist[k]=false; for(int i=1;i<=n;i++) { if((map[k][i]>0)&&(dis[i]>dis[k]+map[k][i])) { dis[i]=map[k][i]+dis[k]; if(exist[i]==false) { Team[tail++]=i; exist[i]=true; } } } head++; } } int main() { cin>>n>>m>>t; memset(map,0x3f,sizeof map ); memset(w,0x3f,sizeof w ); memset(dis,0x3f,sizeof dis ); for(int i=1;i<=m;i++) { int x,y,z; cin>>x>>y>>z; map[x][y]=z; w[x][y]=z; } SPFA(t);// 从起点开始到其他每个点找一遍最短路 for(int k=1;k<=n;k++) { for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(w[i][j]>w[i][k]+w[k][j]) w[i][j]=w[i][k]+w[k][j]; } } } int max; for(int i=1;i<=n;i++) { if((i==1)||(dis[i]+w[i][t]>max)) max=dis[i]+w[i][t]; } printf("%d",max); return 0; }
思路:一遍SPFA求出起点到其他所有点的最短路,一遍Floyed求出所有点到起点的最短路,两者相加,和最大者即为anwser...
相关文章推荐
- [Poj 3268][Usaco2007 Feb]Cow Party奶牛派对
- poj 3268 && bzoj 1631: [Usaco2007 Feb]Cow Party(最短路)
- BZOJ1631: [Usaco2007 Feb]Cow Party 最短路 Spfa
- BZOJ 1631==USACO 2007== POJ 3268 Cow Party奶牛派对
- [BZOJ] 1631: [Usaco2007 Feb]Cow Party
- BZOJ 1631: [Usaco2007 Feb]Cow Party( 最短路 )
- bzoj 1631: [Usaco2007 Feb]Cow Party【spfa】
- 【BZOJ 1631】 [Usaco2007 Feb]Cow Party
- BZOJ 1631: [Usaco2007 Feb]Cow Party
- bzoj 1631: [Usaco2007 Feb]Cow Party 解题报告
- bzoj1631 [Usaco2007 Feb]Cow Party(Dijkstra)
- BZOJ 1631: [Usaco2007 Feb]Cow Party spfa
- 【BZOJ】1631: [Usaco2007 Feb]Cow Party(dijkstra)
- bzoj1631 [Usaco2007 Feb]Cow Party
- BZOJ1631 [Usaco2007 Feb]Cow Party
- BZOJ 1631: [Usaco2007 Feb]Cow Party
- poj 3278 && bzoj 1646: [Usaco2007 Open]Catch That Cow 抓住那只牛(BFS)
- 【bzoj1641】 Usaco2007 Nov Cow Hurdles 奶牛跨栏 最短路
- 【BZOJ】【1046】/【POJ】【3613】【USACO 2007 Nov】Cow Relays 奶牛接力跑
- 【poj 3268】 Silver Cow Party 【USACO 2007 February Silver】