Pagini recente » Cod sursa (job #1014082) | Cod sursa (job #2278318) | Cod sursa (job #110125) | Cod sursa (job #2290206) | Cod sursa (job #756611)
Cod sursa(job #756611)
#include <cstdio>
#include <cstring>
#include <vector>
#define MAX 10010
using namespace std;
vector<int>u[MAX];
int st[MAX], dr[MAX];
int n,m, nr_c;
bool viz[MAX];
bool dfs(int x){
int y;
if( viz[x] ) return 0;
viz[x] = 1;
for(int i=0;i<u[x].size();i++)
{
y = u[x][i];
if( st[y] == 0 || dfs(st[y]) )
{
st[y] = x;
dr[x] = y;
return 1;
}
}
return 0;
}
void cuplaj_maxim(){
bool ok = 1;
while( ok )
{
ok = 0;
memset( viz,0,sizeof(viz) );
for(int i=1;i<=n;i++)
if( dr[i] == 0 && dfs(i) )
{
nr_c++;
ok = 1;
}
}
}
int main(){
int nr, x, y;
freopen("cuplaj.in","r",stdin);
freopen("cuplaj.out","w",stdout);
scanf("%d %d %d",&n,&m,&nr);
while(nr--)
{
scanf("%d %d",&x,&y);
u[x].push_back(y);
}
cuplaj_maxim();
printf("%d\n",nr_c);
for(int i=1;i<=n;i++)
if( dr[i] ) printf("%d %d\n",i,dr[i]);
return 0;
}