Comments
0

upd: I got it, nevermind now.
0

so next week you will become 1 dan.
0

Auto comment: topic has been updated by Meguhine (previous revision, new revision, compare).
-49

Can you set different time limits for different languages? Just like, 1s for C/C++, 2s for Python/Java, etc.
+11

My understanding for example 4 in E:

Choose 5 as root, change (5,8) to (5,1)

change (1,8) to (1,7)

change (1,10) to (1,6)

and you have 6 leaves now (includes 5)
+12

Why is the time changed? I remember it started from 17:00 UTC+8
0

Why is this greedy strategy correct?
0

What does "you have skill issue on speed smh" means in J?
+3

Yes, I also discovered that just after I posted this lol.

Ahh, I was such an idiot, I think I would pass if I just delete the brute force.

Thank you anyway.
+91

I think D is easier than C lol. It takes me nearly 50 mins to come up with C, but only 25 mins on D.
0

True, I found these thinking problems hard for me as well.
+3

u can see my code, use dp.

dp[u][i] means in u's subtree (includes u), pathes that start with u has a maximum of i dangerous node (i ∈ {0,1,2})

for the staus's transformation, u can look through my code or just think with yourself.

Code
0

btw thanks for the great round, FairyWinx
0

OHHHH catgirl power! I may become purple this round!
0

Can someone tell me why my code for D get runtime error? Thank you in advance

My Code
On HoangMC2009 → Can't find C++14, 3 years ago
0

So I start to use C++ 17 lol
On HoangMC2009 → Can't find C++14, 3 years ago
0

I met the same problem with u
0

Meguhine Thanks
+31

I love long and detailed tutorials which help me understand the problems better. Thank you awoo, BledDest, Roms!
On awoo → Codeforces Round 916 (Div. 3), 3 years ago
0

The tutorial finally comes out!
0

So educational rounds have less ad-hoc problems and require us to use standard algorithms more?
+1

What's the difference bwtween normal rounds and educational rounds? It really bothers me.
+1

It's actually the same as the editorial's solution, just changes the order to calculate ans. But your way is more easy to understand, and then we can clearly see that each number would push on and pop out in the stack for at most once, thus the time complexity is O(n).
0

But what we human need is a thinkable machine rather than a omnipotent database. If a new kind of cp problem (required with some new algortihms) comes out in the future, would a database finds out the corresponding answer? No, it will just try every combination of the alogorithms in its databse, and eventually tell us it doesn't know.
+1

Nearly 24 hours have passed, and the rating still doesn't change?
0

Me, too. Hope I re-get blue after this round.
0

Nice solution (for D though)! Thank you!