KDVinit's blog

The Quarantine Contest
By KDVinit, 3 years ago, In English

Hola, budding coders of the IIT Madras and Codeforces!

On [contest_time:360591], Programming Club IIT Madras will host The Quarantine Contest and we would like to invite all of you for the same.

The contest is hosted as a reminder to IITM students who are at their Quarantine Hostels, to follow all the safety protocols. It will be a combined unrated round for all divisions : )

The contest consists of 8-9 problems [ICPC Style Scoring] to be solved in 150 minutes. While all the problems will be exciting and fun for the participants of the Camp, we believe that the first 4 problems would be easy for the experienced coders & the later problems would be challenging for all.

The round will provide a good range of problems in terms of difficulty, and every problem would definitely be thrilling for the Participants.

The prizes for the Official Participants — All the Students of IIT Madras:

  • Top 7 Coders from IITM will receive cash prizes.
  • Top 7 Coders from IITM and Codeforces will also be acknowledged on this blog.

We’d like to credit,

We are also Grateful to CFI, IIT Madras for overseeing the contest and our beloved MikeMirzayanov for Polygon and CodeForces Platforms.

Last but not least, Thank You for participating in the round : )

The contest would definitely be fun and exciting for all the participants. To register for the contest: Click Here

Good luck and see you in the standings : )

Editorial: The Editorial for the contest is out now. You can view the same here — The Quarantine Contest — Editorial.

Congratulations to the winners!

Top 3 Coders (Overall Standings):

Rank Name CF ID
1 Xuan Bach thenymphsofdelphi
2 Nisanth D Nisanth
3 Tom Smith rui_er

Top 7 IIT-M Coders (Official Standings):

Rank Name CF ID Roll Number
1 Nisanth D Nisanth CS20B057
2 Yash Bhagwat blitztage EP19B021
3 Hemesh DJ HemeshDJ CS20B031
4 Dhana Sekar C dhana_sekar ME18B134
5 Teja Dronadula Teja-Smart CS20B026
6 Harsha Katarapu Harsha221B CS20B037
7 Ramanan S ramzz EE18B145

First Solves (All Participants)

Problem Competitor Time of Solve
A NightSky 00:01
B NightSky 00:04
C Teja-Smart 00:10
D thenymphsofdelphi 00:14
E thenymphsofdelphi 00:23
F IceKnight1093 00:06
G thenymphsofdelphi 00:37
H IceKnight1093 00:50

First Solves (Official Participants)

Problem Competitor Time of Solve
A blitztage 00:02
B Teja-Smart 00:04
C Teja-Smart 00:10
D parth2003 00:27
E Teja-Smart 00:48
F IceKnight1093 00:06
G No solves :) --:--
H IceKnight1093 00:50

Hope you all enjoyed the round!

  • Vote: I like it
  • +64
  • Vote: I do not like it

»
3 years ago, # |
  Vote: I like it +29 Vote: I do not like it

Problem Authors won't be participating in round :). Hope I can come in top 10 from IITM.

→ Reply
»
3 years ago, # |
  Vote: I like it +13 Vote: I do not like it

:)

→ Reply
»
3 years ago, # |
  Vote: I like it +50 Vote: I do not like it

Late announcement :(

→ Reply
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

some hints for G ?

→ Reply
»
3 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Does Problem D requires something to do with Digit DP?

I hope the editorial to be out soon.

→ Reply
  • »
    »
    3 years ago, # ^ |
    ← Rev. 3   Vote: I like it +11 Vote: I do not like it

    Dp -> Yes
    Digit Dp -> Most probably not

    Let the number of words formed till $$$i'th$$$ index be $$$dp[i]$$$.

    Now for all $$$ dp[i]=dp[i-1] $$$ (Considering that we interpret the value as it is) Now if $$$s[i-1]*10+s[i]<26$$$, we can merge these two values to get dp[i-2] more words i.e. $$$dp[i]+=dp[i-2]$$$

    → Reply
»
3 years ago, # |
  Vote: I like it +26 Vote: I do not like it

still no editorials :(

→ Reply