Pagini recente » Cod sursa (job #293956) | Cod sursa (job #1849944) | Cod sursa (job #1723213) | Cod sursa (job #1415076) | Cod sursa (job #1879114)
#include <fstream>
#include <vector>
#include <bitset>
#define Nmax 100009
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,x,y,sol;
bitset <Nmax> viz;
vector <int> G[Nmax], cc;
void Dfs(int node)
{
viz[node] = 1;
//cc.push_back(node);
for (auto x : G[node])
if (!viz[x]) Dfs(x);
}
int main()
{
f>>n>>m;
for (int i=1; i<=m; ++i)
{
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for (int i=1; i<=n; ++i)
if (!viz[i])
{
++sol;
Dfs(i);
// fa ceva cu cc
//if (cc.size() > 0) {
// cc.clear();
//}
}
g<<sol<<'\n';
f.close();
g.close();
return 0;
}