Pagini recente » Cod sursa (job #659579) | Cod sursa (job #3126013) | Cod sursa (job #2658384) | Cod sursa (job #2877535) | Cod sursa (job #3243616)
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
bool ok = false, viz[10005];
int n, m, k, a, b, ct, st[10005], dr[10005];
vector<int>noduri[10005];
bool cuplaj(int nod)
{
if(viz[nod])
{
return 0;
}
viz[nod] = 1;
for(auto it: noduri[nod])
{
if(dr[it] == 0)
{
st[nod] = it;
dr[it] = nod;
return 1;
}
}
for(auto it : noduri[nod])
{
if(cuplaj(dr[it]))
{
st[nod] = it;
dr[it] = nod;
return 1;
}
}
return 0;
}
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int32_t main(int argc, char * argv[])
{
fin >> n >> m >> k;
for(int i = 1; i <= k; ++i)
{
fin >> a >> b;
noduri[a].push_back(b);
}
do
{
ok = 0;
memset(viz, 0, sizeof viz);
for(int i = 1; i <= n; ++i)
{
if(!st[i])
ok |= cuplaj(i);
}
}while(ok);
for(int i = 1; i <= n; ++i)
{
if(st[i])
{
ct++;
}
}
fout << ct << '\n';
for(int i = 1; i <= n; ++i)
{
if(st[i])
{
fout << i << " " << st[i] << '\n';
}
}
return 0;
}