Cod sursa(job #3371644)

Utilizator alex_postelnicuPostelnicu Alexandru alex_postelnicu Data 31 octombrie 2026 10:52:20
Problema Componente biconexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.71 kb
#include <bits/stdc++.h>
using namespace std;
int n,m,i,j,k,timer,timed[100005],timemn[100005],seen[100005],inst[100005],parent[100005];
vector<int>g[100005];
queue<int>q;
stack<int>st;
vector<vector<int>>ans;
void dfs(int u)
{
    timer++;
    timed[u]=timer;
    timemn[u]=timer;
    seen[u]=1;
    st.push(u);
    inst[u]=1;
    for (auto v : g[u])
    {
        if (parent[u]!=v)
        {
            if (!seen[v])
            {
                parent[v]=u;
                dfs(v);
                timemn[u]=min(timemn[u],timemn[v]);
                if (timemn[v]>=timed[u])
                {
                    vector<int>aux;
                    int tp=0;
                    while (tp!=v)
                    {
                        tp=st.top();
                        st.pop();
                        aux.push_back(tp);
                        inst[tp]=0;
                    }
                    aux.push_back(u);
                    ans.push_back(aux);
                }
            }
            else
            {
                timemn[u]=min(timemn[u],timed[v]);
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    freopen("biconex.in", "r", stdin);
    freopen("biconex.out", "w", stdout);
    cin>>n>>m;
    while (m--)
    {
        cin>>i>>j;
        g[i].push_back(j);
        g[j].push_back(i);
    }
    for (i=1; i<=n; i++)
    {
        if (!seen[i])
        {
            dfs(i);
        }
    }
    cout<<ans.size()<<"\n";
    for (auto it : ans)
    {
        for (auto it2 : it)
        {
            cout<<it2<<" ";
        }
        cout<<"\n";
    }

}