Pagini recente » Cod sursa (job #2758907) | Cod sursa (job #1106820) | Cod sursa (job #1864611) | Cod sursa (job #446678) | Cod sursa (job #1464384)
#include <fstream>
#include <bitset>
#include <vector>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
const int NMAX = 10005;
bool schimbat;
int n, p, nr;
int S[NMAX], D[NMAX];
bitset<NMAX> Viz;
vector<int> Graf[NMAX];
bool pair_up(int nod)
{
if(Viz[nod]) return false;
Viz[nod] = true;
for(auto x : Graf[nod])
if(!D[x]) {
S[nod] = x, D[x] = nod;
return true;
}
for(auto x : Graf[nod])
if(pair_up(D[x])) {
S[nod] = x, D[x] = nod;
return true;
}
return false;
}
int main()
{
int x, y;
fin >> n >> p >> p;
for(int i=1; i<=p; i++) {
fin >> x >> y;
Graf[x].push_back(y);
}
do {
schimbat = false;
Viz.reset();
for(int i=1; i<=n; i++)
if(!S[i] && pair_up(i))
schimbat = true;
} while(schimbat);
for(int i=1; i<=n; i++) nr += !!S[i];
fout << nr << '\n';
for(int i=1; i<=n; i++)
if(S[i]) fout << i << ' ' << S[i] << '\n';
return 0;
}