-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLuogu_CF_1060_E.cpp
38 lines (38 loc) · 917 Bytes
/
Luogu_CF_1060_E.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include <bits/extc++.h>
using namespace std;
namespace pbds = __gnu_pbds;
using ui = unsigned int;
using uli = unsigned long long int;
using li = long long int;
using Graph = vector<vector<size_t>>;
struct node {
vector<node *> son;
size_t sz;
size_t id;
node *fa;
node(Graph mp, size_t p, node *_fa = nullptr): son(), sz(1), id(p), fa(_fa) {
for (size_t i : mp[p])
if (fa == nullptr || fa->id != i)
son.emplace_back(new node(mp, i, this)), sz += son.back()->sz;
}
};
uli dissum(node *p) {
uli res = 0;
for (node *i : p->son) res += dissum(i) + i->sz;
return res;
}
int main(void) {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
size_t n;
cin >> n;
Graph mp(n);
for (size_t i = 1; i < n; ++i) {
size_t x, y;
cin >> x >> y;
--x, --y;
mp[x].push_back(y), mp[y].push_back(x);
}
node *root = new node(mp, 0);
cout << ;
return 0;
}