Depth-First Search Algorithm Implementation in C++
unknown
c_cpp
6 months ago
1.3 kB
3
Indexable
#include <bits/stdc++.h> using namespace std; typedef long long int ll; #define endl "\n" #define int long long const double PI = 3.14159265358979; const ll INF = 1e18; const ll MOD = 1e9 + 7; const ll nax = 100002; const int LOG = 25; class Solver { int n, ans = 0; vector<vector<int> > adj; vector<int> sz; vector<int> parent; void dfs(int u, int par, int dep) { parent[u] = par; sz[u] = 1; for (int v: adj[u]) { if (v != par) { dfs(v, u, dep + 1); sz[u] += sz[v]; // ans += sz[v] * (n - sz[v]); } } } public: void solve() { cin >> n; adj.resize(n + 1); parent.resize(n + 1); sz.resize(n + 1); for (int i = 1; i < n; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); adj[y].push_back(x); } dfs(1, 0, 0); for (int i = 1; i <= n; i++) { ans += sz[i] * (n - sz[i]); } cout << ans << endl; } }; signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t = 1; // cin >> t; while(t--) { Solver solver; solver.solve(); } return 0; }
Editor is loading...
Leave a Comment