Hi everyone!
I recently come across this interesting topic of Round-Square Tree in the solution for the recent AtCoder Beginner Contest. This is the link for the editorial which refers the concept.
I find the idea interesting as it is simpler than the official solution which uses network flow. But I couldn't find much resources on the topic online.
So if anybody knows about the topic or have some resources then please add them in the comments. Also if you know some questions related to this topic, do attach them in the comments.
Auto comment: topic has been updated by Pranshu_Pandya (previous revision, new revision, compare).
Resource 1: https://drive.google.com/file/d/13dkr1dnaly1RMjyO-RqTStSbIBSdrL6q/view?usp=sharing
Resource 2: https://drive.google.com/file/d/1bJSeainagA_wR3ugPqMtcjuvM-LyB_fO/view?usp=sharing
Thanks man!
Problems related to Round-square Tree: https://mirror.codeforces.com/problemset/problem/487/E
Maybe aka Block-cut Tree?
Oh thanks! I wasn't aware of this.
Chinese resource where i learnt it from (you can use google translate)
Thanks a lot, it is explaining in good details.
Another resource
Thanks! It covers wide variety of topic related to connectivity from scratch and also provides problems for it, exactly what I needed.
Nice! This seems to be from a series of weekly classes. Do you happen to have the link where I can access all of them?
Looks like replacing the 8 in the url with other numbers works.
Yeah, I saw. But I wonder if there isn't a nicer way.
I don't know any nicer way, I just found that specific lecture on Google.