题意:
有 k 个人要从地球去月球,中间有 n 个空间站,标号 1、2、…、n(地球标号为0,月球为-1),有 m 艘太空船在期间穿梭,每艘可载 h[i] 个人,每辆太空船有固定的路线,比如1–>3–>4–>1–>3–>…,太空船在两点之间耗费的时间为 1 ,求把所有人都从地球送到月球的时间,若不能到达月球输出 0
题解:
这题构图太巧妙了,先按飞船飞行建立分层图,如果最大流没到 k,则继续往下建新层,直到最大流
≥
k
\geq k
≥k,不能到达的情况用并查集判断一下就行
#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<list>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#include<random>
using namespace std;
#include<ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
#include<ext/rope>
using namespace __gnu_cxx;
#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
const int mod = 1e9+7;
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
const int INF = 0x3f3f3f3f;
const int N = 2e5+10;
struct node{
int to,next;
int cap;
}e[N];
int head[N],cnt=1;
int vis[N],f[100],g[25][25],h[N],len[100],dis[N],maxflow;
int n,m,k,S,T;
void add(int u,int v,int cap){
e[++cnt]={v,head[u],cap};head[u]=cnt; swap(u,v);
e[++cnt]={v,head[u],0};head[u]=cnt;
}
int find(int x){return x==f[x]?f[x]:f[x]=find(f[x]);}
void merge(int x,int y){
x=find(x),y=find(y);
if(x!=y)f[x]=y;
}
bool bfs(){
memset(dis,0,sizeof dis);
queue<int>q;
q.push(S);
dis[S]=1;
while(!q.empty()){
int u=q.front(); q.pop();
for(int i=head[u];~i;i=e[i].next){
int v=e[i].to;
if(e[i].cap&&!dis[v]){
dis[v]=dis[u]+1;
if(v==T)return 1;
q.push(v);
}
}
}
return 0;
}
int dfs(int u,int delta){
if(u==T)return delta;
int res=0;
for(int i=head[u];~i;i=e[i].next){
int v=e[i].to;
if(dis[v]==dis[u]+1&&e[i].cap>0){
int flow=dfs(v,min(e[i].cap,delta));
e[i].cap-=flow,e[i^1].cap+=flow;
delta-=flow,res+=flow;
}
}
return res;
}
#define endl '\n'
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
memset(head,-1,sizeof head);
cin>>n>>m>>k;
S=0,T=1e5;
for(int i=1;i<=n+2;i++)f[i]=i;
for(int i=1;i<=m;i++){
cin>>h[i]>>len[i];
for(int j=0;j<len[i];j++){
cin>>g[i][j];
if(g[i][j]==0)g[i][j]=n+1;
if(g[i][j]==-1)g[i][j]=n+2;
if(j)merge(g[i][j-1],g[i][j]);
}
}
if(find(n+1)!=find(n+2)){cout<<0<<endl; return 0;}
for(int t=1;;t++){
add(S,t*(n+1),INF);
for(int i=1;i<=m;i++){//建立新层
int u=(t-1)%len[i],v=t%len[i];
if(g[i][u]==n+2) u=T;
else u=(t-1)*(n+1)+g[i][u];
if(g[i][v]==n+2) v=T;
else v=t*(n+1)+g[i][v];
add(u,v,h[i]);
}
while(bfs())maxflow+=dfs(S,INF);
if(maxflow>=k){cout<<t<<endl; return 0;}
for(int i=1;i<=n+1;i++)//连接第t层到t+1层
add((t-1)*(n+1)+i,t*(n+1)+i,INF);
}
}