Pagini recente » Cod sursa (job #995323) | Cod sursa (job #1846354) | Cod sursa (job #1572250) | Cod sursa (job #698266) | Cod sursa (job #2776292)
#include<fstream>
#include<vector>
using namespace std;
#define N 100001
ifstream F("biconex.in");
ofstream G("biconex.out");
vector<int> g[N];
int p,u,n,m,i,c[N],r,d[N],f[N],q[10*N];
void P(int i)
{
int j,k=g[i].size();
c[i]=2,q[++p]=i;
for(j=k-1;j>=0;--j)
if(c[g[i][j]]==1)
P(g[i][j]);
}
void E(int i)
{
int j,k=g[i].size();
d[i]=f[i]=u++,c[i]=1;
for(j=k-1;j>=0;--j)
if(!c[g[i][j]]) {
E(g[i][j]);
if(f[i]>f[g[i][j]])
f[i]=f[g[i][j]];
if(d[i]<=f[g[i][j]])
c[i]=2,q[++p]=i,P(g[i][j]),c[i]=1,q[++p]=0,++r;
} else if(f[i]>d[g[i][j]])
f[i]=d[g[i][j]];
}
int main()
{
F>>n>>m;
while(m--)
F>>i>>u,g[i].push_back(u),g[u].push_back(i);
for(i=1;i<=n;++i)
if(!c[i])
if(g[i].size())
E(i);
else
c[i]=2,q[++p]=i,q[++p]=0,++r;
G<<r<<"\n";
for(--p;p;--p)
if(q[p])
G<<q[p]<<" ";
else
G<<"\n";
return 0;
}