Pagini recente » Cod sursa (job #828191) | Cod sursa (job #341727) | Cod sursa (job #896475) | Cod sursa (job #556943) | Cod sursa (job #727818)
Cod sursa(job #727818)
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
#define dim 100005
vector <int> v[dim];
int viz[dim], level[dim],r[dim],n ,m, e,nrt;
void read()
{
int x, y, i;
fin>>n >>m >>e;
for(i=1;i<=e;++i)
{
fin>>x >>y;
v[x].push_back(y);
}
}
int pairup(int nod)
{
if(viz[nod]==1)
return 0;
viz[nod]=1;
for(int k=0;k<(int)v[nod].size();++k)
if(r[v[nod][k]]==0)
{
level[nod]=v[nod][k];
r[v[nod][k]]=nod;
return 1;
}
for(int k=0;k<(int)v[nod].size();++k)
if(pairup(v[nod][k]))
{
level[nod]=v[nod][k];
r[v[nod][k]]=nod;
return 1;
}
return 0;
}
void solve()
{
int i, ok=1;
while(ok!=0)
{
ok=0;
memset(viz,0,sizeof(viz));
for(i=1;i<=n;++i)
if(!level[i] && pairup(i))
{
ok=1;
++nrt;
}
}
}
int main()
{
read();
solve();
fout<<nrt;
return 0;
}