Pagini recente » Cod sursa (job #1362380) | Cod sursa (job #1797750) | Cod sursa (job #2835718) | Cod sursa (job #467030) | Cod sursa (job #1437079)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
#define nmax 10006
int viz[nmax],s[nmax],d[nmax];
vector <int> G[nmax];
int HK(int nod)
{
if(viz[nod])
return 0;
viz[nod]=1;
if(!G[nod].empty())
for(int i=0;i<G[nod].size();i++)
if(!d[G[nod][i]]||HK(d[G[nod][i]]))
{
d[G[nod][i]]=nod;
s[nod]=G[nod][i];
return 1;
}
return 0;
}
int main()
{int n,m,k;
f>>n>>m>>k;
for(int i=1;i<=k;i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
}
int ok=1,sol=0;
while(ok)
{
ok=0;
for(int i=1;i<=n;i++)
viz[i]=0;
for(int j=1;j<=n;j++)
if(!s[j])
if(HK(j))
ok=1;
}
for(int i=1;i<=n;i++)
if(s[i])
sol++;
g<<sol<<'\n';
for(int i=1;i<=n;i++)
if(s[i])
g<<i<<" "<<s[i]<<'\n';
return 0;
}