Pagini recente » Cod sursa (job #3291133) | Cod sursa (job #602489) | Cod sursa (job #1885158) | Cod sursa (job #2230223) | Cod sursa (job #337260)
Cod sursa(job #337260)
#include <fstream>
#include <vector>
#include <string.h>
using namespace std;
#define nmax 10005
vector<int> v[nmax];
int l[nmax],r[nmax],n,m,sol;
bool viz[nmax];
void read()
{
int e,x,y;
ifstream f("cuplaj.in");
f>>n>>m>>e;
for(int i=0;i<e;i++)
{
f>>x>>y;
v[x].push_back(y);
}
}
bool cuplaj(int nod)
{
if(viz[nod]) return 0;
viz[nod]=true;
int i,x;
for(i=0;i<v[nod].size();i++)
{
x=v[nod][i];
if(!r[x])
{
r[x]=nod;
l[nod]=x;
return 1;
}
}
for(i=0;i<v[nod].size();i++)
{
x=v[nod][i];
if(r[x]&&cuplaj(r[x]))
{
r[x]=nod;
l[nod]=x;
return 1;
}
}
return 0;
}
void solve()
{
bool ok=true;
while(ok)
{
ok=false;
memset(viz,false,sizeof(viz));
for(int i=1;i<=n;i++)
{
if(!l[i]&&cuplaj(i))
{
ok=true;
sol++;
}
}
}
}
void show()
{
ofstream g("cuplaj.out");
g<<sol<<endl;
for(int i=1;i<=n;i++)
if(l[i])
g<<i<<" "<<l[i]<<endl;
}
int main()
{
read();
solve();
show();
return 0;
}