Cod sursa(job #1717686)

Utilizator calin1Serban Calin calin1 Data 15 iunie 2016 16:08:06
Problema Parcurgere DFS - componente conexe Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>
#define N 100005

using namespace std;

int n,m;

bitset <N> viz;

vector <int> G[N];

void dfs(int x)
{
    viz[x]=1;
    for(int i=0; i<G[x].size(); i++)
    {
        if(viz[G[x][i]]==0)
        {
            dfs(G[x][i]);
        }
    }
}

int numarare()
{
    int nr=0;
    for(int i=1; i<=n; i++)
    {
        if(viz[i]==0)
        {
            dfs(i);
            nr++;
        }
    }
    return nr;
}

void citire()
{
    scanf("%d %d\n",&n,&m);
    for(int i=0; i<m; i++)
    {
        int x,y;
        scanf("%d %d\n",&x,&y);

        G[x].push_back(y);
        G[y].push_back(x);
    }

    printf("%d",numarare());
}

int main()
{
    freopen("dfs.in","r",stdin);
    freopen("dfs.out","w",stdout);

    citire();

    return 0;
}