2020.7.7
今天没看题解直接把这道题水过去了。原来和我想的一样。19年我写匈牙利调了一晚上没调出来,之后见到二分匹配就哆嗦。然后今天我的想法是是不是找一个超级源点和汇做增广路就行了,果然是,标号法是我前几天写一个noi的题的时候学的hhhh。连一下边,连源和汇,像分层图那样就行了。一发苟过去了hhh
代码:
#include <bits/stdc++.h>
using namespace std;
#define limit (100000 + 5)//防止溢出
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f
#define lowbit(i) i&(-i)//一步两步
#define EPS 1e-6
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ff(a) printf("%d\n",a );
#define pi(a,b) pair<a,b>
#define rep(i, a, b) for(ll i = a; i <= b ; ++i)
#define per(i, a, b) for(ll i = b ; i >= a ; --i)
#define MOD 998244353
#define traverse(u) for(int i = head[u]; ~i ; i = edge[i].next)
#define FOPEN freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\data.txt", "rt", stdin)
#define FOUT freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\dabiao.txt", "wt", stdout)
typedef long long ll;
typedef unsigned long long ull;
ll read(){
ll sign = 1, x = 0;char s = getchar();
while(s > '9' || s < '0' ){if(s == '-')sign = -1;s = getchar();}
while(s >= '0' && s <= '9'){x = (x << 3) + (x << 1) + s - '0';s = getchar();}
return x * sign;
}//快读
void write(ll x){
if(x < 0) putchar('-'),x = -x;
if(x / 10) write(x / 10);
putchar(x % 10 + '0');
}
int n,m,vs,ve,p;
int layer[limit],head[limit], cnt;
struct node{
int to ,next;
ll flow, w;
}edge[limit];
ll max_flow;
void add_one(int u , int v, ll flow = 0){
edge[cnt].to = v;
edge[cnt].next = head[u];
edge[cnt].flow = flow;
edge[cnt].w = 0;
head[u] = cnt++;
}
inline void add(int u, int v, ll flow){
add_one(u,v,flow);
add_one(v, u,0);
}
inline void init(bool flag = true){
if(flag){
memset(head, -1, sizeof(head));
cnt = 0;
}else{
memset(layer, -1, sizeof(layer));
}
}
bool bfs(){
init(false);
queue<int>q;
layer[vs] = 0;//从第0层开始
q.push(vs);
while (q.size()){
int u = q.front();
q.pop();
traverse(u){
int v = edge[i].to,flow = edge[i].flow;
if(layer[v] == -1 && flow > 0){
layer[v] = layer[u] + 1;//迭代加深
q.push(v);
}
}
}
return ~layer[ve];
}
ll dfs(int u, ll flow){
if(u == ve)return flow;
ll rev_flow = 0,min_flow;
traverse(u){
int v =edge[i].to;
ll t_flow = edge[i].flow;
if(layer[v] == layer[u] + 1 && t_flow > 0){
min_flow = dfs(v, min(flow, t_flow));
flow -= min_flow;
edge[i].flow -= min_flow;
rev_flow += min_flow;
edge[i^1].flow += min_flow;
if(!flow)break;
}
}
if(!rev_flow)layer[u] = -1;
return rev_flow;
}
void dinic(){
while (bfs()){
max_flow += dfs(vs,inf);
}
}
int k;
int main() {
#ifdef LOCAL
FOPEN;
#endif
n = read(), m = read(), p = read();
init();
vs = n + m + 2;
ve = vs + 1;//超级源点和汇点
rep(i ,1,p){
int x = read(), y = read();
add(x, y + n + 1, 1);
}
rep(i ,1,n){
add(vs, i, 1);
}
rep(i ,1,m){
add(i + n + 1, ve, 1);
}
dinic();
write(max_flow);
return 0;
}