Pagini recente » Cod sursa (job #1737394) | Cod sursa (job #1053114) | Cod sursa (job #1400008) | Istoria paginii runda/pregatire_oji_11-12_4 | Cod sursa (job #1496189)
#include<fstream>
#include<vector>
#include<bitset>
#include<cstring>
#define DIM 10015
using namespace std;
int n, m, e, i, j, sol, ok, x, y;
vector<int> v[DIM];
bitset<DIM> viz;
int a[DIM], b[DIM];
char s[20];
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int cupleaza(int nod){
if(viz[nod] == 1){
return 0;
}
viz[nod] = 1;
for(int i = 0; i < v[nod].size(); i++){
int vecin = v[nod][i];
if(b[vecin] == 0){
a[nod] = vecin;
b[vecin] = nod;
sol++;
return 1;
}
}
for(int i = 0; i < v[nod].size(); i++){
int vecin = v[nod][i];
if(cupleaza(b[vecin])){
a[nod] = vecin;
b[vecin] = nod;
return 1;
}
}
return 0;
}
int main(){
fin>> n >> m >> e;
//fin.get();
for(i = 1; i <= e; i++){
x = y = 0;
fin.get();
fin.get(s, 20);
j = 0;
while(s[j] >= '0' && s[j] <= '9'){
x = x * 10 + s[j] - '0';
j++;
}
j++;
while(s[j] >= '0' && s[j] <= '9'){
y = y * 10 + s[j] - '0';
j++;
}
v[x].push_back(y);
}
do{
ok = 0;
viz.reset();
for(i = 1; i <= n; i++){
if(a[i] == 0){
ok = ok || cupleaza(i);
}
}
}while(ok == 1);
fout<< sol <<"\n";
for(i = 1; i <= n; i++){
if(a[i] != 0){
fout<< i <<" "<< a[i] <<"\n";
}
}
return 0;
}