Pagini recente » Cod sursa (job #2286217) | Cod sursa (job #15899) | Cod sursa (job #238812) | Cod sursa (job #32028) | Cod sursa (job #1954955)
# include <fstream>
# include <vector>
# include <cstring>
using namespace std;
ifstream fin("strazi.in");
ofstream fout("strazi.out");
vector<int> Lista[260];
int Marcat[260],l[260],r[260],n,m,i,j,x,y,ok,nr;
int cuplaj(int nc){
if(Marcat[nc]==1)
return 0;
Marcat[nc]=1;
for(int i=0;i<Lista[nc].size();i++){
int nv=Lista[nc][i];
if(l[nv]==0){
l[nv]=nc;
r[nc]=nv;
return 1;
}
}
for(int i=0;i<Lista[nc].size();i++){
int nv=Lista[nc][i];
if(cuplaj(l[nv])){
l[nv]=nc;
r[nc]=nv;
return 1;
}
}
return 0;
}
int main () {
fin>>n>>m;
for(i=1;i<=m;i++){
fin>>x>>y;
Lista[x].push_back(y);
}
ok=1;
while(ok){
ok=0;
memset(Marcat,0,sizeof(Marcat));
for(i=1;i<=n;i++)
if(r[i]==0)
ok=max(ok,cuplaj(i));
}
nr=-1;
for(i=1;i<=n;i++)
if(r[i]==0)
nr++;
fout<<nr<<"\n";
memset(Marcat,0,sizeof(Marcat));
nr=0;
for(i=1;i<=n;i++)
if(l[i]==0){
nr++;
for(j=i;j!=0;j=r[j])
Marcat[j]=nr;
}
for(i=1;i<=n&&nr!=1;i++)
if(r[i]==0)
for(j=1;j<=n;j++)
if(l[j]==0&&Marcat[i]!=Marcat[j]){
fout<<i<<" "<<j<<"\n";
r[i]=j;
l[j]=i;
nr--;
j=n+1;
}
for(i=1;i<=n;i++)
if(l[i]==0){
for(j=i;j!=0;j=r[j])
fout<<j<<" ";
fout<<"\n";
return 0;
}
return 0;
}