Pagini recente » Cod sursa (job #122797) | Cod sursa (job #2701130) | Cod sursa (job #1020400) | Cod sursa (job #871582) | Cod sursa (job #3188666)
#include<bits/stdc++.h>
using namespace std;
ifstream F("biconex.in");
ofstream G("biconex.out");
#define N 100001
vector<int> g[N],q;
int p,u,n,m,i,c[N],r,d[N],f[N];
void P(int i)
{
c[i]=2,q.push_back(i);
for(auto j:g[i])
if(c[j]==1)
P(j);
}
void E(int i)
{
d[i]=f[i]=u++,c[i]=1;
for(auto j:g[i])
if(!c[j]) {
if(E(j),f[i]>f[j])
f[i]=f[j];
if(d[i]<=f[j])
c[i]=2,q.push_back(i),P(j),c[i]=1,q.push_back(0),++r;
} else if(f[i]>d[j])
f[i]=d[j];
}
int main()
{
for(F>>n>>m;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.push_back(i),q.push_back(0),++r;
}
for(G<<r<<'\n',p=q.size()-2;p;q[p]?G<<q[p]<<' ':G<<'\n',--p);
return 0;
}