Pagini recente » Cod sursa (job #169597) | Cod sursa (job #3164915) | Cod sursa (job #2599318) | Cod sursa (job #2360647) | Cod sursa (job #696920)
Cod sursa(job #696920)
#include <fstream>
#include <vector>
using namespace std;
const int N=100002;
int S[N],D[N],nr;
bool use[N];
vector<int> a[N];
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
bool pairup(int x)
{
if (!x || use[x])
return false;
use[x]=true;
for (vector<int>::iterator i=a[x].begin();i!=a[x].end();i++)
if (!D[*i])
{
S[x]=*i;
D[*i]=x;
++nr;
return true;
}
for (vector<int>::iterator i=a[x].begin();i!=a[x].end();i++)
if (pairup(D[*i]))
{
S[x]=*i;
D[*i]=x;
return true;
}
return false;
}
void cuplaj()
{
bool go=true;
int i;
while (go)
{
go=false;
for (i=1;i<=S[0];i++)
use[i]=false;
for (i=1;i<=S[0];i++)
if (!S[i])
go|=pairup(i);
}
}
int main()
{
int k,x,y,i;
in>>S[0]>>D[0]>>k;
while (k--)
{
in>>x>>y;
a[x].push_back(y);
}
cuplaj();
out<<nr<<"\n";
for (i=1;i<=S[0];i++)
if (S[i])
out<<i<<" "<<S[i]<<"\n";
return 0;
}