How can I find the minimum number of edges need to be added to convert a tree graph to binconnected component such that if we remove an edge from that graph, the graph remain connected? Please give me some idea to do that! Thanks in advance :)

# | User | Rating |
---|---|---|

1 | tourist | 3556 |

2 | wxhtxdy | 3520 |

3 | Radewoosh | 3409 |

4 | Benq | 3368 |

5 | mnbvmar | 3280 |

6 | ecnerwala | 3278 |

7 | LHiC | 3276 |

8 | sunset | 3264 |

9 | maroonrk | 3159 |

10 | TLE | 3145 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 189 |

2 | Radewoosh | 177 |

3 | tourist | 173 |

4 | antontrygubO_o | 172 |

5 | PikMike | 166 |

5 | Vovuh | 166 |

7 | rng_58 | 158 |

8 | majk | 156 |

9 | farmersrice | 154 |

10 | Um_nik | 153 |

How can I find the minimum number of edges need to be added to convert a tree graph to binconnected component such that if we remove an edge from that graph, the graph remain connected? Please give me some idea to do that! Thanks in advance :)

↑

↓

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/10/2019 04:03:44 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

See the solutions to the problem called network here. Basically one way is to find the node x such that if x and all its edges are removed, no more than half of the leaf nodes of the original tree are in a single connected component. This can be done with an algorithm similar to finding the centroid of a tree. Then, the edges to add can be found greedily by connecting two edges from the two components with the most remaining leaves and repeating.

Isn't that whole centroid-finding step unnecessary overkill?

All you need to do is add the new edges in such a way that each old edge will lie on some cycle.

To do that, just root the tree at any non-leaf vertex and run a plain dfs. Each time you encounter a leaf, append its number to

`leaves[]`

. At the end, let`s = leaves.size()/2`

. For each valid i, connect`leaves[i]`

and`leaves[i+s]`

.Why does this work? Consider any edge u — parent(u) in the original tree. The leaves in vertex u's subtree form a contiguous interval in the array

`leaves`

. Then we can easily see that some of the new edges we added must have exactly one endpoint in this interval. Each such new edge forms a cycle that contains the u — parent(u) old edge.thanks a lot misof :) Your idea help me to solve the problem.

Hi, I have some troubles with that problem, I use the mkirsche's idea of finding the centroid and after that match leaves from different subtrees.

For the matching I use the misof's method connecting leaves[i] and leaves[i+s].

However I'm getting WA. Now I know that the step of the centroid is overkill, but it should be correct. I really appreciate if you could help me finding my error.

I posted my code and method yesterday in CF POST

Thanks

I've reduced my code to the following CODE

I assign a different color to each adjacent of the centroid (root) and propagate that color to its subtree.

I build a vector of pairs <color of i, i> in the dfs, so all the leaves of the same color are adjacent. Doing the match of leaves[i] and leaves[i+s] whit s = leaves.size()/2 I get AC.

However, when I sort the vector of leaves () (line 79 of my code) I get WA. According to me, sorting the vector of pairs doesn't change the order of colors, just the order between nodes of the same color, so the matching should still working (match 2 leaves of different color).

I can't understand why my solutions es wrong, I hope you could help me. PD: Maybe you dont remember me but I am one of the students who assisted to your training camp in Peru last year.