[CTSC1999]家园 [网络流]

传送门

题解原网 

#include<bits/stdc++.h>
#define N 300
#define M 1000050
#define inf 0x3fffffff
using namespace std;
int first[M],next[M],to[M],w[M],tot=1;
int st,ed=1000000,dis[M]; int n,m,k,ans;
int limit[N],sum[N],circle[N][20]; 
int fa[N]; int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
int merge(int x,int y){x=find(x),y=find(y); if(x!=y) fa[x]=y;}
void add(int x,int y,int z){
	next[++tot]=first[x],first[x]=tot,to[tot]=y,w[tot]=z;
	next[++tot]=first[y],first[y]=tot,to[tot]=x,w[tot]=0;
}
bool bfs(){
	queue<int> q; q.push(st);
	memset(dis,-1,sizeof(dis)); dis[st] = 0;
	while(!q.empty()){
		int x=q.front(); q.pop();
		for(int i=first[x];i;i=next[i]){
			int t=to[i]; if(w[i] && dis[t]==-1){
				dis[t] = dis[x] + 1; q.push(t);
				if(t==ed) return true;
			}
		}
	} return false;
}
int dfs(int u,int flow){
	if(u==ed) return flow; int ans=0;
	for(int i=first[u];i;i=next[i]){
		int t=to[i]; if(dis[t]==dis[u]+1){
			int delta = dfs(t,min(w[i],flow));
			ans += delta , flow -= delta;
			w[i] -= delta , w[i^1] += delta;
			if(flow==0) break;
		}
	} if(flow) dis[u] = -1; return ans;
}
int dinic(){int ans=0; while(bfs()) ans += dfs(st,inf); return ans;}
int main(){
	scanf("%d%d%d",&n,&m,&k); n+=2; 
	for(int i=1;i<=m;i++){
		scanf("%d%d",&limit[i],&sum[i]);
		for(int j=1;j<=sum[i];j++){
			scanf("%d",&circle[i][j]);
			circle[i][j]++;
		} 
	} 
	add(st, 1, inf); add(n, ed, inf);
	for(int time=1;time<=500;time++){
		for(int i=1;i<=m;i++){
			int x,y,pos = time % sum[i]; if(pos==0) pos=sum[i]; x = circle[i][pos];
			if(pos+1 > sum[i]) y = circle[i][1]; else y = circle[i][pos+1];
			if(x==0) x=n; if(y==0) y=n; x += n*(time-1); y += n*time;
			add(x,y,limit[i]); 
		}
		add(st, 1+n*time, inf);
		for(int i=2;i<=n-1;i++) add(i+n*(time-1), i+n*time, inf);
		add(n+n*time, ed, inf); ans += dinic(); 
		if(ans>=k){printf("%d",time); break;}
		if(time==500) {printf("0"); return 0;} 
	} return 0;
}