1109. Conference

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>

using namespace std;
const int INF=0x3f3f3f3f;
const int N=1005;
vector<int>negotiate
;
int f
;
bool visited
;
bool dfs(int x)
{//cout<<x<<endl;
for(unsigned int i=0;i<negotiate[x].size();++i)
{
if(visited[ negotiate[x][i] ])
continue;
visited[ negotiate[x][i] ]=true;
if(f[ negotiate[x][i] ]==-1||(dfs( f[ negotiate[x][i] ] )))
{
f[negotiate[x][i]]=x;
return true;
}
}
return false;
}
int main()
{
//freopen("data.txt","r",stdin);
int n,m,k;
while(scanf("%d %d %d",&n,&m,&k)!=EOF)
{
for(int i=1;i<=n;++i)
negotiate[i].clear();
while(k--)
{
int l1,l2;
scanf("%d %d",&l1,&l2);
negotiate[l1].push_back(l2);
}
memset(f,-1,sizeof(f));
int tmp=0;
for(int i=1;i<=n;++i)
{
memset(visited,false,sizeof(visited));
if(dfs(i))
++tmp;
}
printf("%d\n",n+m-tmp*2+tmp);
}
return 0;
}