HDU 1839 Delay Constrained Maximum Capacity Path(最短路+二分)
来源:互联网 发布:农村淘宝报名表格 编辑:程序博客网 时间:2024/06/05 16:40
思路:把容量排序之后,二分容量然后最短路check就好了
#include<bits/stdc++.h>using namespace std;#define LL long longconst int maxn = 10000+500;int n,m,t;struct Node{int v,t;LL c;Node(){};Node(int vv,LL cc,int tt):v(vv),c(cc),t(tt){};};vector<Node>e[maxn];int d[maxn];LL cc[maxn*6];int inq[maxn];bool check(LL limit){for(int i = 0;i<=n;i++)d[i]=9999999;memset(inq,0,sizeof(inq)); d[1]=0;queue<int>q; q.push(1);inq[1]=1;while(!q.empty()){int u = q.front();q.pop();inq[u]=0;for(int i = 0;i<e[u].size();i++){Node v = e[u][i]; if(v.c < limit)continue;if(d[v.v] > d[u]+v.t){d[v.v] = d[u]+v.t;if(!inq[v.v])q.push(v.v);inq[v.v]=1;}}}if(d[n]<=t)return true;elsereturn false;//return d[n]<=t;}int main(){int T;scanf("%d",&T);while(T--){scanf("%d%d%d",&n,&m,&t);for(int i = 0;i<=n;i++)e[i].clear();memset(cc,0,sizeof(cc)); for(int i = 0;i<m;i++){int u,v,tt;LL c;scanf("%d%d%lld%d",&u,&v,&c,&tt);cc[i]=c;e[u].push_back({v,c,tt});e[v].push_back({u,c,tt});}sort(cc,cc+m);int ans = 0;int l = 0,r=m-1;while(l<=r){int mid = (l+r)/2;if(check(cc[mid])) l = mid+1,ans = cc[mid];elser = mid-1;}printf("%lld\n",ans);}}
0 0
- HDU 1839 Delay Constrained Maximum Capacity Path(二分+最短路)
- HDU-1839 Delay Constrained Maximum Capacity Path 最短路+二分
- HDU 1839 Delay Constrained Maximum Capacity Path 最短路+二分
- 【HDU】1839 Delay Constrained Maximum Capacity Path 二分+最短路
- HDU 1839 Delay Constrained Maximum Capacity Path 最短路+二分
- HDU 1839 Delay Constrained Maximum Capacity Path(最短路+二分)
- hdu 1839 Delay Constrained Maximum Capacity Path 二分+最短路
- HDU 1839 Delay Constrained Maximum Capacity Path (二分最短路)
- HDU 1839 Delay Constrained Maximum Capacity Path(二分+最短路)
- 【HDU 1839】 Delay Constrained Maximum Capacity Path(二分+最短路)
- hdu 1839 Delay Constrained Maximum Capacity Path(最短路+二分)
- HDU 1839 Delay Constrained Maximum Capacity Path(最短路+二分)
- HDU-1839 Delay Constrained Maximum Capacity Path 最短路
- hdu 1839 Delay Constrained Maximum Capacity Path 二分下限+最短路spfa
- HDU 1839 Delay Constrained Maximum Capacity Path(最短路+二分搜索)
- HDU 1839 Delay Constrained Maximum Capacity Path(二分+SPFA)
- hdu 1839 Delay Constrained Maximum Capacity Path(二分+SPFA)
- hdu 1839 Delay Constrained Maximum Capacity Path 二分+ spfa
- Apache知识整理
- 扬长避短
- [LeetCode] 20. Valid Parentheses
- Android ListView/GridView 中Adapter的用法(1)
- Linux平台下让程序或命令在前台或后台运行
- HDU 1839 Delay Constrained Maximum Capacity Path(最短路+二分)
- Google APAC 2017 University Test Round A
- Maven搭建SpringMVC+Hibernate项目详解
- tomcat8 gzip 优化配置
- python类库[进程subprocess与管道pipe]
- Camera viewport
- 【例题&结论】【分治(等比数列二分求和)】NKOJ 3716 数列求和
- 深入Hadoop HDFS(二)
- ubuntu下如何使用mysql/python中如何调用sql新建一个数据库