Pagini recente » Cod sursa (job #2337603) | Cod sursa (job #884158) | Cod sursa (job #929386) | Cod sursa (job #185495) | Cod sursa (job #408534)
Cod sursa(job #408534)
# include <fstream>
# include <iostream>
# include <cstdlib>
using namespace std;
int *a[10003], n, m , e, l[10003], r[10003], u[10003];
void add (int i, int j)
{
a[i][0]++;
a[i]=(int *)realloc(a[i], (a[i][0]+1)*4);
a[i][a[i][0]]=j;
}
void read ()
{
ifstream fin ("cuplaj.in");
fin>>n>>m>>e;
for (int i=1;i<=n;i++)
{
a[i]=(int *)malloc(4);
a[i][0]=0;
}
int x, y;
for (int i=1;i<=e;i++)
{
fin>>x>>y;
add(x, y);
}
}
int pairup (int k)
{
if (u[k])
return 0;
u[k]=1;
for (int i=1;i<=a[k][0];i++)
if (!r[a[k][i]])
{
l[k]=a[k][i];
r[a[k][i]]=k;
return 1;
}
for(int i=1;i<=a[k][0];i++)
if (pairup(r[a[k][i]]))
{
l[k]=a[k][i];
r[a[k][i]]=k;
return 1;
}
return 0;
}
void solve ()
{
int gata=0;
while (!gata)
{
gata=1;
for(int i=1;i<=n;i++)
u[i]=0;
for (int i=1;i<=n;i++)
if (!l[i])
if (pairup(i))
gata=0;
}
}
void write ()
{
ofstream fout ("cuplaj.out");
int cuplaj=0;
for (int i=1;i<=n;i++)
if (l[i]>0)
cuplaj++;
fout<<cuplaj<<endl;
for (int i=1;i<=n;i++)
if (l[i]>0)
fout<<i<<" "<<l[i]<<endl;
}
int main ()
{
read();
solve ();
write ();
return 0;
}
/*# include <vector>
# include <iostream>
# include <algorithm>
# include <cstdio>
using namespace std;
vector<int>g[10003];
int l[10003], r[10003], u[10003], n, m, e;
void read ()
{
freopen ("cuplaj.in", "r", stdin);
scanf("%d%d%d", &n, &m, &e);
for (;e--;)
{
int x, y;
scanf("%d%d", &x, &y);
g[x].push_back(y);
}
}
int pereche (int k)
{
if (u[k])
return 0;
cout<<"$";
u[k]=1;
for (vector<int>::iterator I=g[k].begin();I!=g[k].end();++I)
if (!r[*I])
{
cout<<*I<<endl;
l[k]=*I;
r[*I]=n;
return 1;
}
for (vector<int>::iterator I=g[k].begin();I!=g[k].end();++I)
if (pereche(r[*I]))
{
l[k]=*I;
r[*I]=k;
return 1;
}
return 0;
}
void solve ()
{
int gata=0;
while (!gata)
{
gata=1;
for (int i=1;i<=n;++i)
u[i]=0;
for (int i=1;i<=n;++i)
if (!l[i])
{
cout<<i<<endl;cout.flush();
gata=0;
pereche(0);
// cout<<i;
}
}
}
void write ()
{
int cuplaj=0;
for (int i=1;i<=n;i++)
if (l[i]>0)
cuplaj++;
freopen("cuplaj.out", "w", stdout);
printf("%d\n", cuplaj);
for(int i=1;i<=n;i++)
if (l[i]>0)
printf("%d %d\n", i, l[i]);
}
int main ()
{
read();
for (int i=1;i<=n;i++)
{
cout<<i<<" : ";
for (vector<int>::iterator I=g[i].begin();I!=g[i].end();++I)
cout<<*I<<" ";
cout<<endl;
}
solve ();
write ();
return 0;
}
*/