Pagini recente » Diferente pentru implica-te/arhiva-educationala intre reviziile 102 si 101 | Cod sursa (job #2070692) | Cod sursa (job #406894) | Borderou de evaluare (job #2510167) | Cod sursa (job #914499)
Cod sursa(job #914499)
#include<cstdio>
#include<vector>
#include<cstring>
using namespace std;
int rez,st[10005],dr[10005],x,y,i,n,m,e;
bool ok,viz[10005];
vector<int>v[10005];
bool dfs(int x)
{
if (viz[x]) return false;
viz[x]=true;
for (int j=0;j<v[x].size();j++)
if (!dr[v[x][j]])
{
st[x]=v[x][j];
dr[v[x][j]]=x;
rez++;
return true;
}
for (int j=0;j<v[x].size();j++)
if (!dr[v[x][j]])
{
st[x]=v[x][j];
dr[v[x][j]]=x;
return true;
}
return false;
}
int main()
{
freopen("cuplaj.in","r",stdin);
freopen("cupalj.out","w",stdout);
scanf("%d %d %d",&n,&m,&e);
for (i=1;i<=e;i++) scanf("%d %d",&x,&y),v[x].push_back(y);
ok=true;
while (ok)
{
ok=false;
memset(viz,false,sizeof(viz));
for (i=1;i<=n;i++)if (!st[i]) if (dfs(i)) ok=true;
}
printf("%d\n",rez);
for (i=1;i<=n;i++)
if (st[i]) printf("%d %d",i,dr[i]);
return 0;
}