Pagini recente » Cod sursa (job #1317373) | Cod sursa (job #2769881) | Cod sursa (job #2772316) | Cod sursa (job #2441876) | Cod sursa (job #1613021)
#include<fstream>
#include<vector>
#include<bitset>
#define DIM 10005
using namespace std;
int n, m, ok, i, x, y, e, sol;
vector<int> v[DIM];
int a[DIM], b[DIM];
bitset<DIM> viz;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int cupleaza(int nod){
if(viz[nod] == 1){
return 0;
}
viz[nod] = 1;
int vecin, i;
for(i = 0; i < v[nod].size(); i++){
vecin = v[nod][i];
if(b[vecin] == 0){
sol++;
a[nod] = vecin;
b[vecin] = nod;
return 1;
}
}
for(i = 0; i < v[nod].size(); i++){
vecin = v[nod][i];
if(cupleaza(b[vecin])){
a[nod] = vecin;
b[vecin] = nod;
return 1;
}
}
return 0;
}
int main(){
fin>> n >> m >> e;
for(i = 1; i <= e; i++){
fin>> x >> y;
v[x].push_back(y);
}
do{
ok = 0;
viz.reset();
for(i = 1; i <= n; i++){
if(a[i] == 0 && cupleaza(i)){
ok = 1;
}
}
}while(ok == 1);
fout<< sol <<"\n";
for(i = 1; i <= n; i++){
if(a[i] != 0){
fout<< i <<" "<< a[i] <<"\n";
}
}
return 0;
}