THOUSES, First two subtasks alone WA

badri18 · May 17, 2021, 10:05am

I tried my best to resolve the WA on the first two subtasks
Someone, please help me finding where I went wrong.
My code and the result is here

taran_1407 · May 17, 2021, 10:21am

You assumed that the for edge (u, v), u will be parent of v. First two files had cases failing that.

See corrected code.

badri18 · May 17, 2021, 10:39am

Thanks so much @taran_1407

mospy · May 17, 2021, 1:07pm

@taran_1407 i have considered this case also but still getting WA for 1st 2 cases but i have used bfs !
can give some hint why?

cp_guy · May 17, 2021, 2:11pm

First I would like to suggest you that you should not cheat in any ogoing contest. So the mistake you need to avoid first is stop cheating. You have cheated in the question Valid Path.

akshitm16 · May 17, 2021, 2:13pm

You can generate some small random test cases where your solution would fail against the official one.

https://test-case-generator.herokuapp.com/
You can use this in case you don’t want to write the code for random generation of trees on your own.

brijesh_989 · May 17, 2021, 2:20pm

https://www.codechef.com/viewsolution/46609983
i have tried all cases but I am not getting where I am doing wrong can anybody suggest me where I am doing wrong (only first 2 cases) . thanks in advance …

badri18 · May 17, 2021, 2:39pm

In some of the long contests, I start with one or two problems and then due to college works or some other priorities I would’ve left them incomplete. So my rating graph looks soo irregular.