Pagini recente » Atasamentele paginii petic | Diferente pentru problema/armonica intre reviziile 1 si 2 | Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #1036635)
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int N, M, nrm, x, y, ok=1, st[10005], dr[10005], sol;
vector < int > G[10005];
bitset < 10005 > viz;
int pair_up(int nod)
{
if (viz[nod]) return 0;
viz[nod]=1;
for (vector <int>::iterator it=G[nod].begin(); it!=G[nod].end(); ++it)
if (!dr[*it])
{
st[nod]=*it;
dr[*it]=nod;
return 1;
}
for (vector <int>::iterator it=G[nod].begin(); it!=G[nod].end(); ++it)
if (dr[*it] && pair_up(dr[*it]))
{
st[nod]=*it;
dr[*it]=nod;
return 1;
}
return 0;
}
int main()
{
f>>N>>M>>nrm;
for (int i=1; i<=nrm; ++i)
{
f>>x>>y;
G[x].push_back(y);
}
while (ok)
{
ok=0;
for (int i=0; i<=10003; ++i)
viz[i]=0;
for (int i=1; i<=N; ++i)
if (!st[i] && pair_up(i))
++sol, ok=1;
}
g<<sol<<'\n';
for (int i=1; i<=N; ++i)
if (st[i]) g<<i<<' '<<st[i]<<'\n';
return 0;
}