You have a list of tree nodes from a collection of trees where each node has an ID and a Name (string) and another ID which determines its parent(-1 in this case the node is a root). You have to be constructed the trees(forest) from the given information.

Can anyone give me an idea how to solve it or give me a fresh implementation. I tried a lot couldn't solve it. I am also new at tree.

Thanks in advance for your help. sorry for my poor English.

Hello everyone, I am passing most depressing time in my life. I solved almost 800-900 problems in my real id. But still in 1200-1300 rating. While my other mates solves less problems and they have also very good rating. I try to leave CP but I cant. Finally I want some suggestions for improve my rating. Or Tell me should I give up?

Sorry to say sometimes I feel I should do suicide because I practiced a lot but I didnt get the expected result/rating.

Please dont downvote me. If you cant help me just ignore the post.

Thanks In Advance :)

Hello, Good people. Hope you all are doing well. I am trying to solve the problem for a while but didnt come up any idea. Can anyone tell me how can I solve this problem?

Problem Link: https://vjudge.net/problem/26879

Thanks in advance. :)

Hello, Good people. Hope you all are doing well. I am trying to solve the problem for a while but didnt come up any idea. Can anyone tell me how can I solve this problem?

Problem Link: https://vjudge.net/problem/Gym-100625J Thanks in advance. :)

Hello, everyone. Hopefully you all are well during this pandemic. Recently I faced many problems with tagged "Bitmask". Also I see sometime people write a code to loop some small range like 1-60 for bitmasking. Can anyone explains a bit how bitmask idea works for CF problems. It would be great if someone explain it.

Thanks in advance :)

Hello, Good people. Hope you all are doing well. I am trying to solve the problem for a while but didnt come up any idea. Can anyone tell me how can I solve this problem?

Problem Link: https://vjudge.net/problem/UVA-1231

Thanks in advance. :)