Pagini recente » Cod sursa (job #2103713) | Cod sursa (job #2444725) | Cod sursa (job #2075831) | Cod sursa (job #1122729) | Cod sursa (job #2550991)
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int st[10005],dr[10005];
bool viz[10005];
vector<int> v[10005];
int cup(int nod){
if(viz[nod]==1){
return 0;
}
viz[nod]=1;
for(int i=0;i<v[nod].size();i++){
if(dr[v[nod][i]]==0){
dr[v[nod][i]]=nod;
st[nod]=v[nod][i];
return 1;
}
else{
if(cup(dr[v[nod][i]])==1){
dr[v[nod][i]]=nod;
st[nod]=v[nod][i];
return 1;
}
}
}
return 0;
}
ifstream cin("cuplaj.in");
ofstream cout("cuplaj.out")
int main(){
int n,m,e,a,b;
cin>>n>>m>>e;
for(int i=1;i<=e;i++){
cin>>a>>b;
v[a].push_back(b);
}
int prevcnt=0,cnt=0;
do{
prevcnt=cnt;
for(int i=1;i<=n;i++){
viz[i]=0;
}
for(int i=1;i<=n;i++){
if(st[i]==0){
cnt+=cup(i);
}
}
}while(prevcnt!=cnt);
cout<<cnt<<"\n";
for(int i=1;i<=m;i++){
if(dr[i]!=0){
cout<<dr[i]<<" "<<i<<"\n";
}
}
}
/**
3 3 6
1 1
1 2
2 1
3 1
3 2
3 3
*/