Cod sursa(job #2925794)

Utilizator valentin12Valentin Ion Semen valentin12 Data 16 octombrie 2022 02:11:13
Problema Componente tare conexe Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.59 kb
#include <fstream>
#include <string.h>
#include <vector>


using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");


int use[100001];
int st[100001];

vector <int> G[100001];
vector <int> gt[100001];
vector <int> ctc[100001];

int sol=0;

inline void dfs(int nod)
{
        use[nod]=1;
        for(int i = 0; i < G[nod].size(); i++)
                if(!use[G[nod][i]])
                    dfs(G[nod][i]);

        st[++st[0]]=nod;
}

void dfstrans(int nod)
{
        use[nod] = 1;
        for(int i = 0 ; i < gt[nod].size(); i++)
                if(!use[gt[nod][i]]) dfstrans(gt[nod][i]);

        ctc[sol].push_back(nod);
}

int main()
{
        int n, m, x, y;

        f >> n >> m;

        for(int i = 1; i <= m; i++)
        {
                f >> x >> y;
                G[x].push_back(y);
                gt[y].push_back(x);
        }

        for(int i = 0; i <= sizeof(st)/sizeof(st[0]); i++)
            st[i] = 0;

        for(int i = 0; i <= sizeof(use)/sizeof(use[0]); i++)
            use[i] = 0;

        for(int i = 1; i <= n; i++)
                if(!use[i]) dfs(i);

        for(int i = 0; i <= sizeof(use)/sizeof(use[0]); i++)
            use[i] = 0;

        for(int i = n; i>0 ; i--)
                if(!use[st[i]])
        {
                sol++;
                dfstrans(st[i]);
        }

        g << sol<< '\n';
        for(int i=1; i <= sol; i++)
        {
                for(int j=0; j < ctc[i].size(); j++)
                        g << ctc[i][j]<<" ";
                g << "\n";
        }

        return 0;
}