Cod sursa(job #1648771)

Utilizator alexmisto342Turdean Alexandru alexmisto342 Data 11 martie 2016 11:36:37
Problema Cuplaj maxim in graf bipartit Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <fstream>
#include <vector>
#define x first
#define y second
#define mp make_pair
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int i,j,n,m,a,b,c,nod,cuplaj,f[10005],s[10005],d[10005];
vector <int > v[10005];
bool cuplare(int nod)
{
    int j;
    if(f[nod] == i)
        return 0;
    f[nod] = i;
    for(j = 0; j < v[nod].size(); j++)
        if(s[ v[nod][j] ] == 0)
        {
            s[ v[nod][j] ] = nod;
            d[nod] = v[nod][j];
            return 1;
        }
    for(j = 0; j < v[nod].size(); j++)
        if( cuplare(s[ v[nod][j] ]) )
        {
            s[ v[nod][j] ] = nod;
            d[nod] = v[nod][j];
            return 1;
        }
    return 0;

}
int main()
{
    fin >> n >> m >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> a >> b;
        v[a].push_back(b);
    }
    for(i = 1; i <= n; i++)
        if(cuplare(i))  cuplaj++;

    fout<<cuplaj<<'\n';

    for(i = 1; i <= n; i++)
        if(d[i])
            fout<<i<<" "<<d[i]<<'\n';
    return 0;
}