hdu1839之二分+邻接表+Dijkstra+队列优化
2013-08-18 13:34
337 查看
Delay Constrained Maximum Capacity Path
Time Limit: 10000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 544 Accepted Submission(s): 192
Problem Description
Consider an undirected graph with N vertices, numbered from 1 to N, and M edges. The vertex numbered with 1 corresponds to a mine from where some precious minerals are extracted. The vertex numbered with N corresponds to a minerals processing factory. Each
edge has an associated travel time (in time units) and capacity (in units of minerals). It has been decided that the minerals which are extracted from the mine will be delivered to the factory using a single path. This path should have the highest capacity
possible, in order to be able to transport simultaneously as many units of minerals as possible. The capacity of a path is equal to the smallest capacity of any of its edges. However, the minerals are very sensitive and, once extracted from the mine, they
will start decomposing after T time units, unless they reach the factory within this time interval. Therefore, the total travel time of the chosen path (the sum of the travel times of its edges) should be less or equal to T.
Input
The first line of input contains an integer number X, representing the number of test cases to follow. The first line of each test case contains 3 integer numbers, separated by blanks: N (2 <= N <= 10.000), M (1 <= M <= 50.000) and T (1 <= T <= 500.000). Each
of the next M lines will contain four integer numbers each, separated by blanks: A, B, C and D, meaning that there is an edge between vertices A and B, having capacity C (1 <= C <= 2.000.000.000) and the travel time D (1 <= D <= 50.000). A and B are different
integers between 1 and N. There will exist at most one edge between any two vertices.
Output
For each of the X test cases, in the order given in the input, print one line containing the highest capacity of a path from the mine to the factory, considering the travel time constraint. There will always exist at least one path between the mine and the
factory obbeying the travel time constraint.
Sample Input
2 2 1 10 1 2 13 10 4 4 20 1 2 1000 15 2 4 999 6 1 3 100 15 3 4 99 4
Sample Output
13 99
题目:给m条管道,每条管道有可运输的最大容量和消耗的时间c,t
现在有东西要从1运输到n,必须在时间T内完成,求符合条件的可运输的最大容量
分析:对于所给的m条管道的最大容量,进行排序,然后二分容量求从1到n的最短时间即可
#include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<string> #include<queue> #include<algorithm> #include<map> #include<vector> #include<iomanip> #define INF 99999999 using namespace std; const int MAX=10000+10; int s[MAX*5],n,m,t; int size,head[MAX],dist[MAX]; bool mark[MAX]; typedef pair<int,int>mp; struct Edge{ int v,c,t,next; Edge(){} Edge(int &V,int &C,int &T,int NEXT):v(V),c(C),t(T),next(NEXT){} }edge[MAX*5*2]; inline void Init(int num){ memset(head,-1,sizeof(int)*(num+2)); size=0; } inline void InsertEdge(int u,int v,int &c,int &t){ edge[size]=Edge(v,c,t,head[u]);//头插法 head[u]=size++; } inline bool Dijkstra(int s,int t,int c,int T){ for(int i=1;i<=n;++i)mark[i]=false,dist[i]=INF; dist[s]=0,mark[s]=true; priority_queue< mp,vector<mp>,greater<mp> >q; mp oq; q.push(mp(0,s)); while(!q.empty()){ oq=q.top(); q.pop(); if(oq.first>T)return false; if(oq.second == t)return dist[t];//dist[t]<=T; mark[oq.second]=true; for(int i=head[oq.second];i != -1;i=edge[i].next){ int v=edge[i].v; if(mark[v] || edge[i].c<c)continue; if(oq.first+edge[i].t<dist[v]){ dist[v]=oq.first+edge[i].t; q.push(mp(dist[v],v)); } } } return false;//无法到达t } int main(){ int num,u,v,c,T; cin>>num; while(num--){ scanf("%d%d%d",&n,&m,&t); Init(n); for(int i=0;i<m;++i){ scanf("%d%d%d%d",&u,&v,&c,&T); InsertEdge(u,v,c,T); InsertEdge(v,u,c,T); s[i]=c; } sort(s,s+m); int left=0,right=0,mid; for(int i=1;i<m;++i)if(s[i] != s[i-1])s[++right]=s[i]; while(left<=right){ mid=left+right>>1; if(Dijkstra(1,n,s[mid],t))left=mid+1; else right=mid-1; } printf("%d\n",s[right]); } return 0; }
相关文章推荐
- hdu1839之二分+邻接表+Dijkstra+队列优化
- Dijkstra + 优先队列 + 邻接表优化
- 最短路径(四)—Bellman-Ford的队列优化(邻接表)
- hdu 1874 畅通工程续 dijsktra dijkstra+邻接表 优先队列 bellman-ford bellman-ford队列优化(基础题目,一步步优化)
- hdu(2544)——最短路(邻接表+bellman-ford使用队列优化)
- Bellman-Ford队列优化(邻接表)
- POJ1724 Dij队列优化邻接表
- 队列优化并使用邻接表存储的Bellman-Ford算法模板解决最短路径存在负权边问题
- poj 1847 最短路 dijkstra模板(vector邻接表+队列优化)
- poj1821 单调队列优化
- <斜率优化><单调队列>——2.T_OY(踢欧阳^_^)
- 2016 UESTC Training for Dynamic Programming J - 柱爷抢银行II dp单调队列优化
- hdu 3514 dp + 单调队列优化
- poj 1821 单调队列优化dp详解
- Trade-----HDU3401----单调队列优化的DP
- dijkstre+heap(用STL优先队列优化)
- 【日常学习】【二分】【单调队列优化线性DP】codevs3342 绿色通道题解
- 优先队列优化Dijkstra-hdu2066
- POJ 1821 Fence 单调队列优化dp
- UVA 1471 Defense Lines 单调队列优化