Pagini recente » Cod sursa (job #2741627) | Cod sursa (job #10812) | Cod sursa (job #2558914) | Cod sursa (job #145396) | Cod sursa (job #2971806)
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pf push_front
#define MOD 1000000007
#define MAX 10005
using namespace std;
vector < int > v[MAX];
int p[MAX];
bool viz[MAX], cuplat[MAX];
bool dfs(int nod);
int main()
{
ifstream cin("cuplaj.in");
ofstream cout("cuplaj.out");
int l, r, m, x, y, i, nr = 0;
bool ok = 1;
cin >> l >> r >> m;
for(i = 1; i <= m; i++)
{
cin >> x >> y;
v[x].pb(y);
}
while(ok == 1)
{
ok = 0;
for(i = 1; i <= l; i++) viz[i] = 0;
for(i = 1; i <= l; i++) if(cuplat[i] == 0 && dfs(i) == 1)
{
nr++;
ok = 1;
}
}
cout << nr << '\n';
for(i = 1; i <= r; i++) if(p[i] != 0) cout << p[i] << ' ' << i << '\n';
return 0;
}
bool dfs(int nod)
{
viz[nod] = 1;
for(int it:v[nod])
if(p[it] == 0 || (viz[p[it]] == 0 && dfs(p[it]) == 1))
{
p[it] = nod;
cuplat[nod] = 1;
return 1;
}
return 0;
}