Pagini recente » Cod sursa (job #1462304) | Cod sursa (job #912625) | Cod sursa (job #2848314) | Cod sursa (job #1252235) | Cod sursa (job #303541)
Cod sursa(job #303541)
#include <stdio.h>
#include <vector>
#include <string.h>
using namespace std;
#define NMAX 10010
int L[NMAX], R[NMAX];
vector<int> g[NMAX];
int n, m, e;
short uz[NMAX];
void read()
{
scanf("%d %d %d", &n, &m, &e);
while(e--)
{
int x, y;
scanf("%d %d", &x, &y);
g[x].push_back(y);
}
}
short pair_up(int x)
{
++uz[x];
for(vector<int> :: iterator it = g[x].begin(); it != g[x].end(); ++it)
if(!R[*it])
{
R[*it] = x;
L[x] = *it;
return 1;
}
for(vector<int> :: iterator it = g[x].begin(); it != g[x].end(); ++it)
if(!uz[ R[*it] ] && pair_up(R[*it]))
{
R[*it] = x;
L[x] = *it;
return 1;
}
return 0;
}
int main()
{
freopen("cuplaj.in", "r", stdin);
freopen("cuplaj.out", "w", stdout);
read();
for(short ok = 1; ok;)
{
memset(uz, 0, sizeof(uz));
ok = 0;
for(int i = 1; i <= n; ++i)
if(!L[i])
ok |= pair_up(i);
}
int res = 0;
for(int i = 1; i <= n; ++i)
if(L[i])
++res;
printf("%d\n", res);
for(int i = 1; i <= n; ++i)
if(L[i])
printf("%d %d\n", i, L[i]);
return 0;
}