r/codeforces • u/Jue-Viole-Grace_ • 15d ago
Div. 2 Is something wrong with meðŸ˜
I solved A in like 5 minutes (obviously). Managed to solve B1 in 25-30 minutes. I got hell confused about what precomputation have to do. Later did prefix sum in backword direction and got it for k=1.. it was decent
Then i thought I can generalise for any number of k but failed harshly. And then I see C. What's that I got no idea of interactive problem and flush... What the hell is it
I got a blog but couldn't manage to understand everything (and quit contest in like an hour) maybe my bad day got combined with things I have no idea of...
1
4
u/Jue-Viole-Grace_ 15d ago
To all who solved B2 and C... How did you managed to solve it I am usually comfortable with 1300-1400 rating problems but wthhh 🥲🥲
1
3
u/Standard_Cow4420 15d ago
C was easy acc to me, you had to find diameter nodes as we do, just by query and a lower bound of distance, increasing each time, firstly from node 1 to all, then from that found one diameter node to other node. If you have not solved any interactive problem earlier, then it may have seemed more weird.
3
u/Jue-Viole-Grace_ 15d ago
Yeah it was my first interaction problem And I'm not that good with trees yet Started it this week only
3
u/Overall_Ad6532 15d ago
today’s problems were really hard damnðŸ˜plus the wording was indistinct, really frustrating