Pagini recente » Cod sursa (job #1687341) | Cod sursa (job #2926885) | Cod sursa (job #3173986) | Cod sursa (job #1934713) | Cod sursa (job #963839)
Cod sursa(job #963839)
#include <fstream>
#include <vector>
const static int maxn = 10073;
using namespace std;
vector <int> graf[maxn];
int n,m,e;
int l[maxn], r[maxn];
bool sel[maxn];
bool cupleaza(int x)
{
int i;
if (sel[x]) return 0;
sel[x] = true;
for (i=0; i<graf[x].size(); i++)
if (!r[graf[x][i]])
{
l[x] = graf[x][i];
r[graf[x][i]] = x;
return 1;
}
for (i=0; i < graf[x].size(); i++)
if (cupleaza(r[graf[x][i]]) )
{
l[x] = graf[x][i];
r[graf[x][i]] = x;
return 1;
}
return 0;
}
int main()
{
int x,y;
ifstream in("cuplaj.in");
in>>n>>m>>e;
for(int i=1; i<=e; i++)
{
in>>x>>y;
graf[x].push_back(y);
}
int cuplaj=0;
bool ok;
while(ok)
{
ok=false;
fill(sel,sel+n+1,false);
for(int i=1;i<=n;++i)
{
if(l[i]==0)
if(cupleaza(i)==1)
ok=true;
}
}
for(int i=1;i<=n;++i)
if(l[i] != 0) cuplaj ++;
ofstream out("cuplaj.out");
out<<cuplaj<<"\n";
for(int i=1;i<=n;i++)
if (l[i] != 0)
out<<i<<" "<<l[i]<<"\n";
return 0;
}