Pagini recente » Cod sursa (job #2614691) | Cod sursa (job #2031023) | Cod sursa (job #2025622) | Borderou de evaluare (job #2296906) | Cod sursa (job #2507678)
#include <fstream>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int n,m;
int mc[400001];
int urm[400001];
int lst[200001];
bool viz[200001];
void dfs(int x)
{
viz[x]=1;
for(int i=lst[x];i!=0;i=urm[i])
if(!viz[ mc[i] ])
dfs(mc[i]);
}
int main()
{
cin>>n>>m;
for(int i,j,k=1;k<=2*m;k+=2)
{
cin>>i>>j;
mc[k]=i,mc[k+1]=j;
urm[i]=lst[j],urm[j]=lst[i];
lst[i]=k+1,lst[j]=k;
}
int nr=0;
for(int i=1;i<=n;i++)
if(!viz[i])
{
nr++;
dfs(i);
}
cout<<nr;
}