(1)题意:
有n个点,m条路径,1是起点,n是终点,最多Tmin
经过一条路径需要花费D分钟,这条路径的最大容积是C,(就是只有容积小于路径容积的货物才能通过。)
问从1~n在T分钟内,最多能运多少体积的货物。
(2)思路:
记录所有的体积,从小到大排序,二分查找最大且时间之和在T分钟之内的体积。(和西安的M题一样)
(3)注意:
二分时要l<=r,避免l = r的情况出现。
(4)代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long LL;
const int maxn = 5e5+10;
const LL INF = 2e9+10;
LL tim[maxn],T,cap[maxn];
int vis[maxn],tot,n,m,head[maxn];
struct Node{
int v,nxt;
LL C,D;
}cur[maxn];
void Init(){
memset(head,-1,sizeof(head));
tot = 0;
}
void Add(int x,int y,LL C,LL D){
cur[tot] = Node{y,head[x],C,D};
head[x] = tot++;
}
bool spfa(LL vol){
for(int i=1;i<=n;i++){
tim[i] = INF;vis[i] = 0;
}
queue <int> q;
q.push(1);tim[1] = 0;
while(!q.empty()){
int x = q.front();q.pop();vis[x] = 0;
for(int i=head[x];i!=-1;i=cur[i].nxt)
if(cur[i].C>=vol){
int y = cur[i].v;
if(tim[y]>tim[x]+cur[i].D){
tim[y] = tim[x]+cur[i].D;
if(vis[y]==0){
vis[y] = 1;
q.push(y);
}
}
}
}
return tim[n]<=T;
}
int main(void){
int X;scanf("%d",&X);
while(X--){
Init();
scanf("%d%d%lld",&n,&m,&T);
for(int i=1;i<=m;i++){
int x,y;
LL C,D;
scanf("%d%d%lld%lld",&x,&y,&C,&D);
Add(x,y,C,D);
Add(y,x,C,D);
cap[i] = C;
}
cap[0] = 0;cap[m+1] = 0;
sort(cap+1,cap+1+m);
int l = 1,r = m,mid;
LL ans = 0;
while(l<=r){
mid = (l+r)>>1;
if(spfa(cap[mid])){
ans = cap[mid];
l = mid+1;
}
else r = mid-1;
}
printf("%lld\n",ans);
}
return 0;
}