Pagini recente » Cod sursa (job #2790472) | Cod sursa (job #958414) | Cod sursa (job #2842146) | Cod sursa (job #3146591) | Cod sursa (job #404445)
Cod sursa(job #404445)
#include<cstdio>
#include<bitset>
#include<vector>
using namespace std;
#define NMAX 10005
#define sh short int
#define pb push_back
sh N,M,x,y,dr[NMAX],st[NMAX];
int nr,E;
bitset<NMAX>viz;
vector<sh>a[NMAX];
bool df (sh n)
{
if (viz[n])
return 0;
viz[n]=1;
size_t g=a[n].size();
for (size_t i=0; i<g; ++i)
{
if (!dr[a[n][i]])
{
st[n]=a[n][i];
dr[a[n][i]]=n;
return 1;
}
else
if (df(a[n][i]))
{
st[n]=a[n][i];
dr[a[n][i]]=n;
return 1;
}
}
return 0;
}
void cuplaj()
{
sh i;
for (i=1; i<=N; ++i)
{
if (st[i])
continue;
if (df(i))
++nr;
else
{
viz.reset();
if (df(i))
++nr;
}
}
}
int main()
{
freopen("cuplaj.in","r",stdin);
freopen("cuplaj.out","w",stdout);
scanf("%hd%hd%d",&N,&M,&E);
int i;
for (i=1; i<=E; ++i)
{
scanf("%hd%hd",&x,&y);
a[x].pb(y);
}
cuplaj();
printf("%d\n",nr);
for (int i=1;i<=N||i<=M; ++i)
{
if (st[i]&&dr[st[i]])
printf("%hd %hd\n",dr[st[i]],st[i]);
}
return 0;
}