Guys, I want to join a cp discord server/telegram group/any group where people are actively doing competitive coding. I just want people around me doing competitive coding so that I can do too and I promise that I will motivate other people to do this stuff. Let's do it guys.

Please suggest a good server I will be grateful. No matter it's a small group or not. I just want to get involved in competitive coding. If you ask about my rating. I'm near an expert on another account. Please please, please. I want to do something in life.

I know when people around us do something, we do it too :)

Given a rooted tree consisting of n nodes numbered from 1 to n where each node has some number of stones on it represented by the array stones, modify this tree by placing any number of stones on node any number of times.

Now We've to modify the tree such that absolute difference between the number of stones between each pair of adjacent nodes is less than or equal to 1. We've to find the minimum number of extra stones such that this is true.

My approach(Tled): We start from node having maximum number of stones and from there we make two calls in dfs as follows:

1. Make adjacent nodes's stones ​equal to this node's stones

2. Make adjacent nodes's stones equal to this node's stones-1

Constraints: 1<=n<=1e5

I assure you that it's not from ongoing contest because it's here. can someone give any idea?

Can all the heavy-light decomposition (HLD) problems be solved using Binary lifting technique or do I need to learn HLD too? Thanks for helping, I am new to this field.

Extra: Stress away

HealthyUG is still solving already solved problems. His last submission is 2 days before. I hope it's the good news.

And one more request: HealthyUG please don't login to youtube while you are drunk.

Today I'm starting a new blog called cheater's blog...whoever will be caught cheating from now on, I will add his/her name to this blog. You can suggest cheaters in the comments.

1. gangadhar_9119
2. shrutiagarwal14
3. Amitharitwal
4. 5612
5. I_love_Mansur4ik
6. 10_01666

We are given some graph nodes and every node has three things:

1. Cost to include this node

2. Money we get while we include this node.

3. It's parent who should be included if this node is included ( It's may possible to not having a parent for some node )

Now I have to choose some nodes out of these such that total cost of selected nodes shouldn't exceed M and we should be able to earn maximum possible money.

How to solve this problem?