Pagini recente » Monitorul de evaluare | dedicatie | Cod sursa (job #129009) | Cod sursa (job #1224840) | Cod sursa (job #1920740)
#include<fstream>
#include<vector>
#include<cstring>
#define NMAX 10005
using namespace std;
vector<int> G[NMAX];
int n, m, nm, x, y;
int R[NMAX], L[NMAX];
bool u[NMAX];
bool check_cuplaj;
int i;
ifstream cin("cuplaj.in");
ofstream cout("cuplaj.out");
bool cupleaza(int nod)
{
if(u[nod] == 1)
{
return 0;
}
u[nod] = 1;
for(int i = 0; i < G[nod].size(); i++)
{
int fiu = G[nod][i];
if(L[fiu] == 0)
{
R[nod] = fiu;
L[fiu] = nod;
return 1;
}
}
for(int i = 0; i < G[nod].size(); i++)
{
int fiu = G[nod][i];
if(cupleaza(L[fiu]))
{
R[nod] = fiu;
L[fiu] = nod;
return 1;
}
}
return 0;
}
void init()
{
memset(u, 0, sizeof(u));
check_cuplaj = 0;
}
void incearca_cuplaje()
{
do
{
init();
for(i = 1; i <= n; i++)
{
if(R[i] == 0)
{
check_cuplaj |= cupleaza(i);
}
}
}
while(check_cuplaj);
}
void afisare()
{
for(i = 1; i <= n; i++)
{
if(R[i] != 0)
{
cout << i << " " << R[i] << "\n";
}
}
}
int main()
{
cin >> n >> m >> nm;
for(i = 1; i <= nm; i++)
{
cin >> x >> y;
G[x].push_back(y);
}
incearca_cuplaje();
afisare();
return 0;
}