Pagini recente » Cod sursa (job #1210112) | Cod sursa (job #1374993) | Cod sursa (job #1971131) | Cod sursa (job #1430259) | Cod sursa (job #1728714)
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int n,m,e,x,y,ok,etc,i,cup[10001],nr,cups[10001];
vector <int> G[10001];
bitset <10001> viz;
int cupl(int nod)
{
int i,v;
if(viz[nod]) return 0;
viz[nod]=1;
for(i=0;i<G[nod].size();i++)
{
v=G[nod][i];
if(cups[v]==0||cupl(cups[v]))
{
cup[nod]=v;
cups[v]=nod;
return 1;
}
}
return 0;
}
int main()
{
f>>n>>m>>e;
for(i=1;i<=e;i++)
{
f>>x>>y;
G[x].push_back(y);
}
do
{
ok=0;
viz.reset();
for(i=1;i<=n;i++)
{
if(!cup[i]) ok=ok||cupl(i);
}
}while (ok);
for(i=1;i<=n;i++) if(cup[i]) nr++;
g<<nr<<'\n';
for(i=1;i<=n;i++)
if(cup[i]) g<<i<<' '<<cup[i]<<'\n';
return 0;
}