建模:以点表示边,将每个点按坐标拆分,即为X集合和Y集合。
![ContractedBlock.gif](https://i-blog.csdnimg.cn/blog_migrate/8f900a89c6347c561fdf2122f13be562.gif)
![ExpandedBlockStart.gif](https://i-blog.csdnimg.cn/blog_migrate/961ddebeb323a10fe0623af514929fc1.gif)
//
31ms
// Type:最小顶点覆盖
// 思路:最大最小定理(最小顶点覆盖=最大匹配),增广路径算法,用DFS实现
#include < stdio.h >
#include < string .h >
#define NL 510
int adj[NL][NL];
int mth[NL];
bool used[NL];
int path( int u)
{
for ( int v = 1 ; v <= adj[u][ 0 ]; v ++ ) {
int t = adj[u][v];
if ( ! used[t]) {
used[t] = 1 ;
if ( ! mth[t] || path(mth[t])) {
mth[t] = u;
return 1 ;
}
}
}
return 0 ;
}
int main()
{
int n, k, r, c;
int i, j;
int mxth;
while (scanf( " %d%d " , & n, & k) != EOF) {
memset(adj, 0 , sizeof (adj));
memset(mth, 0 , sizeof (mth));
for (i = 0 ; i < k; i ++ ) {
scanf( " %d%d " , & r, & c);
adj[r][ ++ adj[r][ 0 ]] = c;
}
mxth = 0 ;
for (i = 1 ; i <= n; i ++ ) {
memset(used, 0 , sizeof (used));
if (path(i)) {
mxth ++ ;
}
}
printf( " %d\n " , mxth);
}
return 0 ;
}
// Type:最小顶点覆盖
// 思路:最大最小定理(最小顶点覆盖=最大匹配),增广路径算法,用DFS实现
#include < stdio.h >
#include < string .h >
#define NL 510
int adj[NL][NL];
int mth[NL];
bool used[NL];
int path( int u)
{
for ( int v = 1 ; v <= adj[u][ 0 ]; v ++ ) {
int t = adj[u][v];
if ( ! used[t]) {
used[t] = 1 ;
if ( ! mth[t] || path(mth[t])) {
mth[t] = u;
return 1 ;
}
}
}
return 0 ;
}
int main()
{
int n, k, r, c;
int i, j;
int mxth;
while (scanf( " %d%d " , & n, & k) != EOF) {
memset(adj, 0 , sizeof (adj));
memset(mth, 0 , sizeof (mth));
for (i = 0 ; i < k; i ++ ) {
scanf( " %d%d " , & r, & c);
adj[r][ ++ adj[r][ 0 ]] = c;
}
mxth = 0 ;
for (i = 1 ; i <= n; i ++ ) {
memset(used, 0 , sizeof (used));
if (path(i)) {
mxth ++ ;
}
}
printf( " %d\n " , mxth);
}
return 0 ;
}