题面:Luogu2402
好题,二分+最大流
看到这种题嘛直接做啊,首先Floyd求出两两之间最短路,然后我们考虑二分这个时间
T
,接着建图
这个图啊首先把每个点拆成牛和棚,超级源点
最后用最大流判断一下流量是否是奶牛数就好了
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <ctime>
#include <map>
#include <queue>
#include <cstdlib>
#include <string>
#include <climits>
#include <set>
#include <vector>
#define int long long
using namespace std;
bool vis[300010];
int n,m,f[310][310],a[310],b[310],cur[300010],dist[300010];
int nedge,p[300010],c[300010],nex[300010],head[300010],s,t;
inline void addedge(int x,int y,int z){
p[++nedge]=y;c[nedge]=z;nex[nedge]=head[x];head[x]=nedge;
}
inline bool bfs(int s,int t){
for(int i=s;i<=t;i++)dist[i]=-1;
queue<int>q;q.push(s);dist[s]=1;
while(!q.empty()){
int now=q.front();q.pop();
for(int k=head[now];k>-1;k=nex[k])if(c[k]&&dist[p[k]]==-1){
dist[p[k]]=dist[now]+1;q.push(p[k]);
}
}
return dist[t]>-1;
}
inline int dfs(int x,int low){
if(x==t)return low;
int a,used=0;
for(int k=cur[x];k>-1;k=nex[k])if(c[k]&&dist[p[k]]==dist[x]+1){
a=dfs(p[k],min(c[k],low-used));
if(a)c[k]-=a,c[k^1]+=a,used+=a;
if(c[k])cur[x]=k;
if(used==low)break;
}
if(!used)dist[x]=-1;
return used;
}
inline int dinic(){
int flow=0;
while(bfs(s,t)){
for(int i=s;i<=t;i++)cur[i]=head[i];
flow+=dfs(s,1e15);
}
return flow;
}
signed main()
{
ios::sync_with_stdio(0);
cin>>n>>m;int sum=0;
for(int i=1;i<=n;i++)cin>>a[i]>>b[i],sum+=a[i];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)f[i][j]=1e15;
f[i][i]=0;
}
for(int i=1;i<=m;i++){
int x,y,z;cin>>x>>y>>z;
f[x][y]=f[y][x]=min(f[x][y],z);
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)f[i][j]=min(f[i][j],f[i][k]+f[k][j]);
int l=0,r=1e15,ans=1e15;
s=0;t=2*n+1;
while(l<=r){
int mid=l+r>>1;
nedge=-1;memset(nex,-1,sizeof nex);memset(head,-1,sizeof head);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)if(f[i][j]<=mid){
addedge(i,j+n,1e15);addedge(j+n,i,0);
}
for(int i=1;i<=n;i++){
addedge(s,i,a[i]);addedge(i,s,0);
addedge(i+n,t,b[i]);addedge(t,i+n,0);
}
int flow=dinic();
if(flow>=sum)ans=mid,r=mid-1;
else l=mid+1;
}
if(ans==1e15)cout<<"-1";
else cout<<ans;
return 0;
}