Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- #include <vector>
- #include <fstream>
- using namespace std;
- const int maxn = 1e5 + 10;
- int n;
- vector<int> graph[maxn];
- int dfs(int node, int parent) {
- int cows = (int) graph[node].size();
- if(parent == -1) {
- cows++;
- }
- int cnt_cows = 1, days_to_send = 0;
- while(cnt_cows < cows) {
- cnt_cows *= 2;
- days_to_send++;
- }
- int result = days_to_send;
- for(int neighbour : graph[node]) {
- if(neighbour != parent) {
- result += dfs(neighbour, node) + 1;
- }
- }
- return result;
- }
- int main() {
- cin >> n;
- for(int i = 1; i < n; i++) {
- int a, b;
- cin >> a >> b;
- a--;
- b--;
- graph[a].push_back(b);
- graph[b].push_back(a);
- }
- cout << dfs(0, -1) << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement