Cod sursa(job #1762968)
| Utilizator | Data | 24 septembrie 2016 11:27:18 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> lv[100000];
vector <int>::iterator ii;
int main()
{
int n, m, x, y;
f >> n >> m;
for (int i = 0; i < m; i++)
{
f >> x >> y;
lv[x].push_back(y);
//lv[y].push_back(x);
}
int nr = 0;
for (int i = 1; i <= n; i++)
for (ii = lv[i].begin(); ii != lv[i].end(); ++ii)
nr++;
g << n - nr;
//cout << "\n";
return 0;
}