Pagini recente » Cod sursa (job #2969084) | Cod sursa (job #2611468) | Cod sursa (job #3285518) | Cod sursa (job #1970183) | Cod sursa (job #2686041)
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
const int dim=1e5+10;
typedef long long ll;
typedef pair<int,int> pi;
int t,T,n,m,a,b;
vector < int > V[dim],viz(dim,0);
void BFS(int s)
{
queue < int > qu;
qu.push(s);
viz[s]=1;
while(!qu.empty())
{
int nod=qu.front();
qu.pop();
viz[nod]=2;
for(unsigned int vecin:V[nod])
if(!viz[vecin])
{
viz[vecin]=1;
qu.push(vecin);
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>a>>b;
V[a].pb(b);
V[b].pb(a);
}
int ans=0;
for(int i=1;i<=n;i++)
if(!viz[i])
{
ans++;
BFS(i);
}
g<<ans;
return 0;
}