Pagini recente » Cod sursa (job #55465) | Cod sursa (job #1992131) | Cod sursa (job #2962205) | Cod sursa (job #589292) | Cod sursa (job #1397749)
#include <stdio.h>
#include <vector>
#include <string.h>
#define MAXN 10005
using namespace std;
int n, m, edges, l[MAXN], r[MAXN], x, y, cupl;
vector<int> GL[MAXN];
bool change, uz[MAXN];
bool pairup(int p){
if(uz[p]) return 0;
uz[p] = 1;
for(auto x: GL[p])
if(!r[x]){
l[p] = x;
r[x] = p;
return 1;
}
for(auto x: GL[p])
if(pairup(r[x])){
l[p] = x;
r[x] = p;
return 1;
}
return 0;
}
int main(){
freopen("cuplaj.in", "r", stdin);
freopen("cuplaj.out", "w", stdout);
int i;
scanf("%d %d %d", &n, &m, &edges);
while(edges--){
scanf("%d %d", &x, &y);
GL[x].push_back(y);
}
change = 1;
while(change){
change = 0;
memset(uz, 0, sizeof(uz));
for(i = 1; i <= n; i++)
if(!l[i])
change |= pairup(i);
}
for(i = 1; i <= n; i++)
cupl += (l[i] != 0);
printf("%d\n", cupl);
for(i = 1; i <= n; i++)
if(l[i])
printf("%d %d\n", i, l[i]);
return 0;
}