大家都很强, 可与之共勉 。
题意:
裸的二分图坠大匹配。
题解:
我萌来想想怎么建图呢(初级向)
首先我萌要一个超级原点
S
,和一个超级汇点
之后我萌对于二分图左边的点,源点
S
向他萌分别连一条流量为
之后我萌对于二分图右边的点,汇点
T
向他萌分别连一条流量为
然后就跑个坠大流。
挺萌的
# include <bits/stdc++.h>
# define N 1010
class Network {
private :
struct edge {
int to, w, nxt ;
edge ( ) { }
edge ( int to, int w, int nxt ) : to ( to ), w ( w ), nxt ( nxt ) { }
} g [N << 1] ;
int head [N], cur [N], ecnt ;
int S, T , dep [N] ;
inline int dfs ( int u, int a ) {
if ( u == T || ! a ) return a ;
int flow = 0, v, f ;
for ( int& i = cur [u] ; i ; i = g [i].nxt ) {
v = g [i].to ;
if ( dep [v] == dep [u] + 1 ) {
f = dfs ( v, std :: min ( g [i].w, a - flow ) ) ;
g [i].w -= f, g [i ^ 1].w += f ;
flow += f ;
if ( a == flow ) return a ;
}
}
if ( ! flow ) dep [u] = -1 ;
return flow ;
}
inline bool bfs ( int S, int T ) {
static std :: queue < int > q ;
memset ( dep, 0, sizeof ( int ) * ( T + 1 ) ) ;
dep [S] = 1 ;
q.push ( S ) ;
while ( ! q.empty ( ) ) {
int u = q.front ( ) ; q.pop ( ) ;
for ( int i = head [u] ; i ; i = g [i].nxt ) {
int& v = g [i].to ;
if ( g [i].w && ! dep [v] ) {
dep [v] = dep [u] + 1 ;
q.push ( v ) ;
}
}
}
return dep [T] ;
}
public :
Network ( ) { ecnt = 1 ; }
inline void add_edge ( int u, int v, int w ) {
g [++ ecnt] = edge ( v, w, head [u] ) ; head [u] = ecnt ;
g [++ ecnt] = edge ( u, 0, head [v] ) ; head [v] = ecnt ;
}
inline int dinic ( int S, int T ) {
this -> S = S, this -> T = T ;
int rt = 0 ;
while ( bfs ( S, T ) ) {
memcpy ( cur, head, sizeof ( int ) * ( T + 1 ) ) ;
rt += dfs ( S, 0x3f3f3f3f ) ;
}
return rt ;
}
} Lazer ;
int main ( ) {
int n, m ;
scanf ( "%d%d", & n, & m ) ;
int a, b ;
const int S = n + 1, T = n + 2 ;
n -= m ;
while ( ~ scanf ( "%d%d", & a, & b ) ) { // a < b ;
Lazer.add_edge ( a, b, 0x3f3f3f3f ) ;
}
for ( int i = 1 ; i <= m ; ++ i ) Lazer.add_edge ( S, i, 1 ) ;
for ( int i = 1 ; i <= n ; ++ i ) Lazer.add_edge ( i + m, T, 1 ) ;
printf ( "%d\n", Lazer.dinic ( S, T ) ) ;
return 0 ;
}