Cod sursa(job #2693851)

Utilizator Danut200333Dumitru Daniel Danut200333 Data 7 ianuarie 2021 11:56:35
Problema Cuplaj maxim in graf bipartit Scor 70
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.87 kb
#include <fstream>
#include <vector>
#include <cstring>

using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int n,m,k,ok=1,st[10001],dr[10001],viz[10001],nr,i,x,y;
vector<int> v[10001];
int pairup(int x)
{
    if(viz[x])return 0;
    viz[x]=1;
    for(int i=0; i<v[x].size(); i++)
    {
        int y=v[x][i];
        if(st[y]==0||pairup(st[y]))
        {
            st[y]=x;
            dr[x]=y;
            return 1;
        }
    }
    return 0;
}
int main()
{
    fin>>n>>m>>k;
    for(i=1; i<=k; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    while(ok)
    {
        memset(viz,0,sizeof(viz));
        ok=0;
        for(i=1; i<=n; i++)if(dr[i]==0&&pairup(i)){ok=1;break;}
    }
    for(i=1; i<=n; i++)if(dr[i])nr++;
    fout<<nr<<'\n';
    for(i=1; i<=n; i++)if(dr[i])fout<<i<<" "<<dr[i]<<'\n';
}