Pagini recente » Cod sursa (job #90324) | Cod sursa (job #2205854) | Solutii preONI 2006 - Runda a 3-a | Cod sursa (job #844296) | Cod sursa (job #1922820)
#include <iostream>
#include <cstdio>
#include <vector>
#define NMAX 10005
using namespace std;
int N,M,E;
vector<int> graf[NMAX];
void citire()
{
scanf("%d%d%d",&N,&M,&E);
for(int i=1;i<=E;i++)
{
int x,y;
scanf("%d%d",&x,&y);
graf[x].push_back(y);
}
}
int st[NMAX],dr[NMAX];
int viz[NMAX];
void reset()
{
for(int i=1;i<=N;i++)
viz[i]=0;
}
bool cupleaza(int nod)
{
if(viz[nod]==1)
return 0;
viz[nod]=1;
for(vector<int>::iterator ii=graf[nod].begin();ii!=graf[nod].end();ii++)
{
int x= *ii;
if(dr[*ii] == 0 || cupleaza(dr[*ii]) == 1)
{
dr[*ii]=nod;
st[nod]=*ii;
viz[nod]=1;
return 1;
}
}
return 0;
}
void rezolva()
{
int ok=1;
while(ok)
{
ok=0;
reset();
for(int i=1;i<=N;i++)
if(st[i]==0&&cupleaza(i))
ok=1;
}
}
int main()
{
freopen("cuplaj.in","r",stdin);
freopen("cuplaj.out","w",stdout);
citire();
rezolva();
return 0;
}