Pagini recente » Cod sursa (job #2101754) | Cod sursa (job #2257802) | Cod sursa (job #855220) | Cod sursa (job #984465) | Cod sursa (job #2694398)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int n, m, e;
const int N = 10041;
vector<int> gra[N];
int rt[N], lt[N];
int ans = 0;
int vi[N];
bool baga(int a, int v){
if(vi[a] == v)return false;
vi[a] = v;
for(auto b : gra[a]){
if(lt[b] == 0){
rt[a] = b;
lt[b] = a;
return true;
}
}
for(auto b : gra[a]){
if(baga(lt[b], v)){
rt[a] = b;
lt[b] = a;
return true;
}
}
return false;
}
int main(){
// ios_base::sync_with_stdio(false);
fin >> n >> m >> e;
for(int i = 0; i < e; ++i){
int a, b;
fin >> a >> b;
gra[a].push_back(b);
}
for(int a = 1; a <= n; ++a){
ans += int(baga(a, a));
}
fout << ans << "\n";
for(int i = 1; i <= n; ++i){
if(rt[i] == 0)continue;
fout << i << " " << rt[i] << "\n";
}
return 0;
}