题目概述
有
n
个点,
解题报告
每个雪道至少清理一次,最多没有限制,所以就是上下界为
我们有很显然的贪心:每次操作从入度为0的点开始(建超级源
S
),到出度为0的点结束(建超级汇
示例程序
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100,maxm=maxn*maxn+2*maxn,MAXINT=((1<<30)-1)*2+1;
int n,S,T,SS,TT,num[maxn+5];
int E,lnk[maxn+5],cur[maxn+5],que[maxn+5],dis[maxn+5];
bool vis[maxn+5];
struct Edge
{
int cap,flow,nxt,son;Edge() {}
Edge(int a,int b,int c,int d) {cap=a;flow=b;nxt=c;son=d;}
};
Edge e[2*maxm+5];
void Add(int x,int y,int L,int R)
{
e[E]=Edge(R-L,0,lnk[x],y);lnk[x]=E++;
e[E]=Edge(0,0,lnk[y],x);lnk[y]=E++;
num[x]-=L;num[y]+=L;
}
bool Bfs(int st,int gl)
{
memset(vis,0,sizeof(vis));
int Head=0,Tail=0;que[++Tail]=st;vis[st]=true;dis[st]=0;
while (Head!=Tail)
{
int x=que[++Head];
for (int j=lnk[x];~j;j=e[j].nxt)
if (e[j].cap>e[j].flow&&!vis[e[j].son])
{
que[++Tail]=e[j].son;vis[e[j].son]=true;
dis[e[j].son]=dis[x]+1;
}
}
return vis[gl];
}
int Dfs(int x,int gl,int MIN=MAXINT)
{
if (!MIN||x==gl) return MIN;
int flow=0,f;
for (int &j=cur[x];~j;j=e[j].nxt)
if (dis[x]+1==dis[e[j].son]&&(f=Dfs(e[j].son,gl,min(MIN,e[j].cap-e[j].flow))))
{
e[j].flow+=f;e[j^1].flow-=f;
flow+=f;MIN-=f;if (!MIN) break;
}
return flow;
}
int Dinic(int st,int gl)
{
int MAX=0;
while (Bfs(st,gl))
{
memcpy(cur,lnk,sizeof(lnk));
MAX+=Dfs(st,gl);
}
return MAX;
}
int main()
{
freopen("program.in","r",stdin);
freopen("program.out","w",stdout);
E=0;memset(lnk,255,sizeof(lnk));memset(num,0,sizeof(num));
scanf("%d",&n);S=0;T=n+1;SS=T+1;TT=SS+1;
for (int i=1;i<=n;i++)
{
int m,x;scanf("%d",&m);if (!m) Add(i,T,0,MAXINT);
while (m--) scanf("%d",&x),vis[x]=true,Add(i,x,1,MAXINT);
}
for (int i=1;i<=n;i++) if (!vis[i]) Add(S,i,0,MAXINT);
for (int i=S;i<=T;i++)
if (num[i]>0) Add(SS,i,0,num[i]); else
if (num[i]<0) Add(i,TT,0,-num[i]);
Add(T,S,0,MAXINT);Dinic(SS,TT);
int lst=e[E-2].flow;
for (int j=lnk[SS];~j;j=e[j].nxt) e[j].flow=e[j].cap,e[j^1].flow=e[j^1].cap;
for (int j=lnk[TT];~j;j=e[j].nxt) e[j].flow=e[j].cap,e[j^1].flow=e[j^1].cap;
e[E-1].flow=e[E-1].cap;e[E-2].flow=e[E-2].cap;
printf("%d\n",lst-Dinic(T,S));
return 0;
}