Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- vector<vector<int> > G;
- vector<bool> odwiedz;
- vector<int> sumadrog;
- vector<int> potomkowie;
- void DFS (int v)
- {
- odwiedz[v] = true;
- for (int i = 0; i < int(G[v].size()); ++i)
- {
- int u = G[v][i];
- if(!odwiedz[u])
- {
- potomkowie[v]++;
- DFS(u);
- potomkowie[v] += potomkowie[u];
- }
- }
- }
- void DFS2 (int v)
- {
- odwiedz[v] = true;
- for (int i = 0; i < int(G[v].size()); ++i)
- {
- int u = G[v][i];
- if(!odwiedz[u])
- {
- sumadrog[v]++;
- DFS2(u);
- sumadrog[v] += sumadrog[u] + potomkowie[u];
- }
- }
- }
- int main()
- {
- ios_base::sync_with_stdio(0);
- cin.tie(0);
- int n;
- cin >> n;
- G.resize(n);
- odwiedz.resize(n);
- sumadrog.resize(n);
- potomkowie.resize(n);
- for (int i = 0; i < n - 1; ++i)
- {
- int a, b;
- cin >> a >> b;
- --a;
- --b;
- G[a].emplace_back(b);
- G[b].emplace_back(a);
- }
- for (int i = 0; i < n; ++i)
- {
- odwiedz.assign(n, 0);
- sumadrog.assign(n, 0);
- potomkowie.assign(n, 0);
- DFS(i);
- DFS2(i);
- odwiedz.assign(n, 0);
- cout << sumadrog[i];
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement