题目:
题目有毒的一点是。。不用输出路径!!!
题解:
拆点,把原来的点拆成两列,二分图,有向图,所以从起点向终点连边
有一个很有趣的结论:最小路径覆盖=原图点数-最大匹配
为什么呢? 其实仔细一想就知道因为只有这些终点没有被匹配啊,要开新路嘛= =
代码:
#include <cstdio>
#include <cstring>
#include <queue>
#define N 300000
#define INF 2000000
using namespace std;
int next[N*2+5],point[N*2+5],tot=-1,remind[N*2+5],v[N*2+5],cur[N*2+5],deep[N*2+5],make[N*2+5];
bool c[N*2+5];
void addline(int x,int y)
{
++tot; next[tot]=point[x]; point[x]=tot; v[tot]=y; remind[tot]=1;
++tot; next[tot]=point[y]; point[y]=tot; v[tot]=x; remind[tot]=0;
}
bool bfs(int s,int t)
{
queue <int> q;
for (int i=s;i<=t;i++)
cur[i]=point[i];
memset(deep,0x7f,sizeof(deep));
q.push(s);
deep[s]=0;
while (!q.empty())
{
int x=q.front(); q.pop();
for (int i=point[x];i!=-1;i=next[i])
if (remind[i] && deep[v[i]]>INF)
deep[v[i]]=deep[x]+1,q.push(v[i]);
}
return deep[t]<INF;
}
int dfs(int now,int t,int limit)
{
if (now==t || !limit) return limit;
int flow=0,f;
for (int i=cur[now];i!=-1;i=next[i])
{
cur[now]=i;
if (deep[v[i]]==deep[now]+1 && (f=dfs(v[i],t,min(limit,remind[i]))))
{
flow+=f;
limit-=f;
remind[i]-=f;
remind[i^1]+=f;
make[now]=v[i];
if (!limit) break;
}
}
return flow;
}
int dinic(int s,int t)
{
int ans=0;
while (bfs(s,t))
ans+=dfs(s,t,INF);
return ans;
}
int main()
{
memset(next,-1,sizeof(next));
memset(point,-1,sizeof(point));
int m,n,x,y,i;
scanf("%d%d",&n,&m);
for (i=1;i<=m;i++)
{
scanf("%d%d",&x,&y); addline(x,y+n);
}
for (i=1;i<=n;i++) addline(0,i);
for (i=1;i<=n;i++) addline(i+n,n*2+1);
int ans=dinic(0,n*2+1);
memset(c,0,sizeof(c));
/* for (i=1;i<=n;i++)
if (!c[i])
{
int lal=0;
c[i]=true;
printf("%d",i);
lal=make[i];
while (lal)
{
if (lal>n) lal-=n;
printf(" %d",lal);
c[lal]=true;
lal=make[lal];
}
printf("\n");
}*/
printf("%d",n-ans);
}