Pagini recente » Cod sursa (job #1885925) | Cod sursa (job #1171265) | Cod sursa (job #917775) | Cod sursa (job #1894229) | Cod sursa (job #2849422)
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#define INF 100000
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int n,m,k,a,b,viz[10001],change=1,l[10001],r[10001],nr;
vector <vector <int>> v(10001);
int pairing (int cur)
{
if (viz[cur]) return 0;
viz[cur]=1;
for (int i=0; i<v[cur].size(); i++)
{
int next=v[cur][i];
if (!r[next])
{
l[cur]=next;
r[next]=cur;
return 1;
}
}
for (int i=0; i<v[cur].size(); i++)
{
int next=v[cur][i];
if (pairing(r[next]))
{
l[cur]=next;
r[next]=cur;
return 1;
}
}
return 0;
}
int main()
{
f>>n>>m>>k;
for (int i=1; i<=k; i++)
{
f>>a>>b;
v[a].push_back(b);
}
while (change>0)
{
// cout<<"DA";
change=0;
memset(viz,0,sizeof(viz));
for (int i=1; i<=n; i++)
{
if (!l[i])
{
//cout<<i<<'\n';
change|=pairing(i);
}
}
//cout<<change<<'\n';
}
for (int i=1; i<=n; i++)
{
if (l[i]>0)
nr++;
}
cout<<nr<<'\n';
for (int i=1; i<=n; i++)
{
if (l[i]>0)
cout<<i<<' '<<l[i]<<'\n';
}
return 0;
}