Cod sursa(job #2774479)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 11 septembrie 2021 18:51:48
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.09 kb
#include<cstdio>
#include<vector>
using namespace std;
#define N 100001
vector<int> g[N];
int n,m,i,d,c[N],l[N],r,v[N],s[2*N],q[2*N],u,t;
void T(int i)
{
	int k,j,o,w;
	s[++t]=i,v[i]=!v[i]?1:v[i],l[i]=c[i]=d++;
	for(w=g[i].size(),j=0;j<w;j++)
        if(!c[g[i][j]]) {
            T(g[i][j]);
            if(l[i]>l[g[i][j]])
                l[i]=l[g[i][j]];
        } else if(v[g[i][j]]==1&&l[i]>c[g[i][j]])
            l[i]=c[g[i][j]];
	if(c[i]==l[i]) {
      	for(k=0,++r;t;) {
            o=s[t--];
            if(o==i||v[o]!=1)
                break;
            q[++u]=o,++k,v[o]=2;
        }
      	if(v[i]==1)
            v[i]=2,++k,q[++u]=i;
      	if(!k)
            --r;
      	else
            q[++u]=0;
	}
}
int main()
{
	freopen("ctc.in","r",stdin),freopen("ctc.out","w",stdout),scanf("%d%d",&n,&m);
	while(m--)
        scanf("%d%d",&i,&d),g[i].push_back(d);
	for(i=1;i<=n;++i)
        if(!c[i])
            T(i);
    for(printf("%d\n",r),--u;u;--u)
        if(!q[u])
            printf("\n");
        else
            printf("%d ",q[u]);
    return 0;
}