Pagini recente » Cod sursa (job #360936) | Cod sursa (job #1302846) | Cod sursa (job #1948091) | Cod sursa (job #42453) | Cod sursa (job #1915364)
#include <fstream>
#include <vector>
#define nmax 10010
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
vector <int> v[nmax];
int l[nmax],r[nmax],cuplaj,i,n,m,e;
bool use[nmax];
bool pairup(int x)
{
if (use[x])
return 0;
use[x]=1;
for (int i=0; i<v[x].size(); i++)
if (!l[v[x][i]])
{
l[v[x][i]]=x;
r[x]=v[x][i];
return 1;
}
for (int i=0; i<v[x].size(); i++)
if (pairup(l[v[x][i]]))
{
l[v[x][i]]=x;
r[x]=v[x][i];
return 1;
}
return 0;
}
int main()
{
fin >> n >> m >> e;
for (i=1; i<=e; i++)
{
int a,b;
fin >> a >> b;
v[a].push_back(b);
}
bool nok=1;
while (nok)
{
nok=0;
for (i=1; i<=n; i++)
if (!r[i])
nok|=pairup(i);
for (i=1; i<=n; i++)
use[i]=0;
}
for (i=1; i<=n; i++)
if (r[i])
cuplaj++;
fout << cuplaj << '\n';
for (i=1; i<=n; i++)
if (r[i])
fout << i << ' ' << r[i] << '\n';
}