drastogi21's blog

By drastogi21, 4 weeks ago, In English,

Hi, Codeforces Community!

Codefest'19 — a diverse roster of high-quality programming competitions by Department of Computer Science and Engineering, IIT(BHU), Varanasi is excited to present Perplexed — the constrained programming event.

Perplexed is one of the most innovative events of CodeFest, whose target is not only gauge a contestant's coding abilities but also how one tackles different situations and constraints. The problemset will include all mind-boggling coding problems, ranging from code obfuscation to language constraints, character limits etc

The contest will take place at HackerRank. This contest will be an individual event with a duration of 2 hours 30 minutes, from Aug/23/2019 20:00 IST. With the creativity that the problems will naturally encourage and INR 50,000 at stake, there is absolutely no reason for a programmer to not give this one a shot!

The contest has been prepared by Enigma27, navpun31, _shanky, hitman623 and me (drastogi21).

UPD1: The contest will start in about an hour.

UPD2: The contest will start in about 15 minutes.

UPD3: The contest has ended.

UPD4: The editorial has been published. You can find the solutions to the problem at HackerRank itself. Feel free to discuss the problems in the comments.

Prizes -

1st Prize-Rs.20000

2nd Prize-Rs.12000

3rd Prize-Rs.8000

1st in India-Rs.6000

1st in IIT(BHU)-Rs.3000

1st in 1/2 year in IIT(BHU)-Rs.1000

UPD: The issue in the checker has been resolved. Following are the winners of the contest. Congrats!

1. .I.

2. JeffreyHo

3. dvshah

First place in India: nishank.suresh

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

»
4 weeks ago, # |
  Vote: I like it -16 Vote: I do not like it

Really excited about the contest... Haven't done much constrained programming before, so will be a great experience for me.

»
4 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

Excited for the contest!!

»
4 weeks ago, # |
  Vote: I like it +14 Vote: I do not like it

Can't wait for the contest!!

»
4 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

Is this contest an April Fool type Contest?

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it -79 Vote: I do not like it

    Can't expect anything better from such NOOB problem-setters.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +28 Vote: I do not like it

    Not exactly, there are algorithmic and other types of problems too: surprise language, codegolf, hack the code etc.

»
3 weeks ago, # |
  Vote: I like it +19 Vote: I do not like it

Why this contest is not listed at https://www.hackerrank.com/contests ?

»
3 weeks ago, # |
  Vote: I like it +11 Vote: I do not like it

Is it rated?

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can you post previous contest links ?

»
3 weeks ago, # |
  Vote: I like it +18 Vote: I do not like it

I got top 3 rank in contest....when will prizes be distributed?

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    How to solve B (the balls one) ?

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      Think about output of the following... 2 4 4

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it +5 Vote: I do not like it

        How did you reach at this test case ?

        • »
          »
          »
          »
          »
          3 weeks ago, # ^ |
            Vote: I like it +5 Vote: I do not like it

          I was considering min priority case

          • »
            »
            »
            »
            »
            »
            3 weeks ago, # ^ |
              Vote: I like it +5 Vote: I do not like it

            Sorry, but isn't the answer 4 only ?

»
3 weeks ago, # |
  Vote: I like it +23 Vote: I do not like it

It was a fun contest....had fun solving problems...very good job by Rastogi ji

»
3 weeks ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Help: why is my answer wrong in Minimal Cover? First test case for example:

Test case #0:
My output:
My code (last submission during contest time):

And a tester I wrote (that doesn't find the mistake):

Tester
  • »
    »
    3 weeks ago, # ^ |
    Rev. 2   Vote: I like it +3 Vote: I do not like it

    Their tester had a bug, this is a result of noobs setting problems

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      But does it still have a bug?

      When I submit the code again I still reach the same results:

      1) WA on HR, because "All points are not inside circles."

      2) But when I run my code on those inputs and check, all points do seem to be inside circles.

      Also found another much less severe bug: the constraint 1 <= r_i <= 1e6 doesn't seem to be enforced at all — my wrong solution that prints both 0 radius and huge radius circles passes all cases...