Codeforces will not be available in the period 01:00-05:00 May, 30 (MSK, UTC +3) because of maintenance. ×

failed_coder's blog

By failed_coder, history, 2 months ago, In English,

Hello everyone!!!

Hope everyone is safe and is doing well. I would like to invite you to participate in HackerEarth March Circuits '20. It's a long contest that will start on March 21, 21:00 IST(check your timezone). This contest will run for 7 days.

This time, the problems were prepared by failed_coder, Finding_Infinity, hackslash_123, krikti, Dalgerok and nikhil_c. Thanks to Arpa for testing the problems and helping us prepare the problems.

Copy-Paste Part :P

March Circuits’20 challenges you with 7 problems and the timeline is as follows:

  • Day — 0 Problem 1, Problem 2 (Approximate)
  • Day — 1 Problem 3, Problem 4
  • Day — 4 Problem 5, Problem 6
  • Day — 6 Problem 7
  • Day — 7 Challenge ends

New problem statements will be published every 48 hours, and yes, ace coders will win amazing vouchers.

This is a rated contest with prizes for the top three coders.

To know more about prizes check out this link.

 
 
 
 
  • Vote: I like it
  • -11
  • Vote: I do not like it

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
2 months ago, # |
  Vote: I like it +29 Vote: I do not like it

I did not receive January Circuit's t-shirt till now

»
2 months ago, # |
Rev. 3   Vote: I like it +36 Vote: I do not like it

Will this be again a joke contest, like it was most of the past months, with :

  • 1/4 of problems with wrong statement
  • 1/4 of problems with incorrect validators
  • 1/4 of problems too easy / with a domain input so small you can bruteforce it offline / use the validator to get the answers
  • 1/4 of fine problems?

I mean, is anybody reading the puzzles before the contest?

Edit: For the 4 problems released right now, it's fine. Maybe they stepped up after all the negative comments lately.

  • »
    »
    2 months ago, # ^ |
    Rev. 2   Vote: I like it +41 Vote: I do not like it

    These contests are a joke over all...

    In November Circuits I got first place, some guy sent me an email asking me to send them my id only to tell me later that my code is "plagiarised" and that they removed me from the winners.

    Recently I got third place in the February Circuits and no one even contacted me for it for now.

    UPD: I just recieved my prize for the February Circuits. So this site is not that much of a joke.

»
2 months ago, # |
Rev. 57   Vote: I like it +99 Vote: I do not like it

The judge for the last problem overflows while calculating score. I get negative score on it, and it reduced my total score :/

  • »
    »
    2 months ago, # ^ |
      Vote: I like it +69 Vote: I do not like it

    Hackerearth would be a much better coding platform if Arpa wasn't the tester.

    I (as well as all the setters I know) have never received any suggestions for improvement of test cases, constraints..nothing. He would just submit a single solution(that also brute one most of the time). No checking of whether edge cases are convered. I could go on and on and on.

    Hackerearth should really look into this matter.

»
2 months ago, # |
Rev. 2   Vote: I like it +29 Vote: I do not like it

Now that I got third place in this contest as well, I want try and do something to actually get my prize. I'm writing here as I really don't know any other place to write this. I tried contacting HackerEarth support a few times before but they just "forward the message the concerned POC" and I get no response after that... I don't understand how a company like HackerEarth can lie to their users like this. I don't really need the money from these contests, I do them for fun. I just feel like I should get the prize if I put in the effort to solve all the poorly prepared tasks instead of being ignored/told that I cheated during the contest.

UPD: I also think that the submission made in the final hour or so are not updated on the leaderboard for some reason.

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Holy Moly I did Minimum and xor or problem using TRIE. Did anyone else used TRIE.

My complexity O(n*32) is better than that of editorial as it does not involve sorting.

link to submission

  • »
    »
    2 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Could you please check why my code gives TLE even I solved using trie having complexity O(n*32). Link to Submission

    • »
      »
      »
      2 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I also at first trie TRIE implementation using pointers and dynamic memory allocation. But it turns out the destructor calls are basically the one causing TLE I don't know why. So that is why I coded the trie using 2d matrix.

    • »
      »
      »
      2 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      All you need to do is sort and check neighbors. No trie is needed, take it easy.

      • »
        »
        »
        »
        2 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I knew that solution. But TC using trie is O(n*32). so it should pass.

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The editorial to "Chef & Chutneys" is suprisingly helpful, thanks for that.

  • »
    »
    2 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    My pleasure! Lemme know if you solve the question I left in the end :)

  • »
    »
    2 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I was eagerly waiting for the editorial as this problem seems very interesting and something new to learn for me :D. Nice problem <3 .

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it
»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

When will rating update?