Pagini recente » Cod sursa (job #2821585) | Cod sursa (job #2624062) | Cod sursa (job #3250019) | Cod sursa (job #2501531) | Cod sursa (job #301401)
Cod sursa(job #301401)
#include <stdio.h>
#include <vector>
#include <string.h>
#define pb push_back
using namespace std;
long n, m, e, a, b, sol, viz[10010], cuplaj[10010], i, ok;
vector<long> G[10010];
long cupleaza(long nod) {
if (viz[nod]) {
return 0;
}
viz[nod] = 1;
for (vector<long>::iterator it = G[nod].begin(); it != G[nod].end(); ++it) {
if (!cuplaj[*it]) {
cuplaj[*it] = nod;
cuplaj2[nod] = 1;
return 1;
}
}
for (vector<long>::iterator it = G[nod].begin(); it != G[nod].end(); ++it) {
if (cuplaj[*it] != nod && cupleaza(cuplaj[*it])) {
cuplaj[*it] = nod;
cuplaj2[nod] = 1;
return 1;
}
}
return 0;
}
int main() {
freopen("cuplaj.in", "r", stdin);
freopen("cuplaj.out", "w", stdout);
scanf("%ld %ld %ld", &n, &m, &e);
for (i = 1; i <= e; ++i) {
scanf("%ld %ld", &a, &b);
G[a].pb(b);
}
ok = 1;
while (ok) {
ok = 0;
memset(viz, 0, sizeof(viz));
for (i = 1; i <= n; ++i) {
if (!cuplaj2[i] && cupleaza(i)) {
++sol;
ok = 1;
}
}
}
printf("%ld\n", sol);
for (i = 1; i <= m; ++i) {
if (cuplaj[i]) {
printf("%ld %ld\n", cuplaj[i], i);
}
}
return 0;
}