I think the reason being is:

5:30 — 7:10 PM IST: AtCoder Beginner Contest 212

6:00 — 8:30 PM IST: ICPC Amritapuri 2020 Mock Round (For Indians)

6:00 — 9:00 PM IST: July 2021 CodeChef Lunchtime (With Extra Prizes for Indians)

Collision at the peak :)

No Codechef Lunchtime is clashing with ABC not the other way around

just do the following K times: suppose dp[i] is the number of paths that end at i, initially only dp[1] = 1.

For every day, all vertices can go to i except those that are broken(and i, of course). So you can just do $$$nextdp[i] = \sum dp[i] - \sum _{j \in adj[i]} dp[j] - dp[i]$$$ , then just swap nextdp and dp.

Well this was the only choice he has! Since he has to top the Codechef Lunchtime also and He manage to get 2 min break in between.

Can anyone tell me the reason for downvote? Was it not "dp on trees" or is something else the reason for downvote?

The issue with your code is that in worst case, it runs in approximately $$$O(n^2k)$$$ because there could be maximum $$${n(n-1)/2} - m$$$ valid edges, so for each iteration of $$$i$$$, the inner loop runs in $$$O(n^2)$$$, hence the TLE.

i wish there was infinity of such genuine,geniosity,pure beauty,attractive,elegant,gorgeous,inspiring,exciting... problems :) thank you .

So you are saying this was not a one time thing ?

Anyways, if the 8 problem ABC is going to be adapted for further ABC too. I wish these 2 points to be implemented.

1. Increase duration a bit (maybe like make it 2 hours ? )
2. Make problem >= F, more in the reach of actual rated range participants. For me personally today, I was done till E in 25 mins and then I stared at screen for rest whole contest. But yes, I understand its my fault and F was actually not that out of reach, but still I think it was pretty hard. (That can be seen by yellow rating to F, G and orange rating to H at kenkoo)

Is this going to be the new standard format? If so, sounds fun!

Try the following trivial testcase with your incorrect code and you should easily see what's wrong with it, the correct output is 2 11:

5
1 1
2 10
1 2
3
3

this problem is G