Hi!
We are thrilled to invite you to participate in the Replay of National High School Programming Contest 2021, tomorrow, June $$$14$$$, at 07:30 pm BST. To participate all you have to do is to create an account on Toph. You can register here.
The authors of the contest are upobir, _Ash__, YouKn0wWho, fsshakkhor, rebornplusplus, Shefin_, Hasinur_, jAckAL_1586, mainstring, Moshiur_, ishtupeed, Peregrine_Falcon, TarifEzaz, ihumaunkabir and shajia. Thanks to TarifEzaz for coordinating the round.
You will be given $$$12$$$ problems and $$$5$$$ hours to solve them. The contest will follow standard ICPC rules.
We tried to create very engaging problems, compact statements, and robust datasets for this round. Hopefully, the participants, with a rating of less than $$$2600$$$, will find the problems stimulating and interesting.
Also, there will be an editorial shortly after the round ends.
Good Luck!
UPD: The problems are available for practice here. Editorials are attached to each of the problems separately.
Bump! Contest starts in less than 45 mins.
I don't know anything about this platform. I see you have some rating. But I can't find any notes if this contest is rated. Is it important for you/platform? Would you guys be against me streaming participation with commentary?
Unrated
YouKn0wWho sorry for tag
The contest is unrated. And I think it would be great if you participate and stream with commentary.
Alright, I'll go live on twitch.tv/um_nik22 once I'm ready
Cool.
This is my 3rd contest in toph and I am finding the time limits really tight for Java. I hope the contests become a bit more java-friendly in the future. I liked the problems though.
Thank you for the feedback, merlin_. I will work on this with the authors for the future contests.
How to solve I and F? In problem I: I could only think of a $$$N^{2}logN$$$ solution. It is clear that K can be atmost $$$logN$$$ and after that answer is always maximum of the array. But I can only think of a dp solution to do this.
C too.
Solution to $$$I$$$: The minimum integer $$$x$$$ s.t. the array $$$a$$$ can be split into $$$2^k$$$ partitions each having sum $$$\le x$$$.
I think _Ash__ can describe it intuitively.
Thanks
All Problem's editorial is not available.Can you please add the remaining one's too?
Added.