Mai intai trebuie sa te autentifici.
Cod sursa(job #2738692)
Utilizator | Data | 6 aprilie 2021 11:16:33 | |
---|---|---|---|
Problema | Cuplaj maxim in graf bipartit | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.02 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
const int lim=1e4+5;
vector<int> vec[lim];
int l[lim],r[lim];
int n,m,e,x,y;
bool ok[lim];
bool unite(int x)
{
if(ok[x])
return false;
ok[x]=true;
for(int a:vec[x])
if(!l[a])
{
r[x]=a;
l[a]=x;
return true;
}
for(int a:vec[x])
if(unite(l[a]))
{
r[x]=a;
l[a]=x;
return true;
}
return false;
}
int main()
{
in>>n>>m>>e;
for(int i=1;i<=e;++i)
{
in>>x>>y;
vec[x].push_back(y);
}
int cuplaj=0;
bool modif=false;
do
{
modif=false;
for(int i=1;i<=n;++i)
ok[i]=false;
for(int i=1;i<=n;++i)
if(!r[i] and unite(i))
{
modif=true;
cuplaj++;
}
}while(modif);
out<<cuplaj<<'\n';
for(int i=1;i<=n;++i)
if(r[i]) out<<i<<' '<<r[i]<<'\n';
return 0;
}