pulkit_180894's blog

Invitation to July-Easy '16 on HackerEarth
By pulkit_180894, 10 years ago, In English

Hello, Codeforces Community!

I invite you all to July Easy '16. The contest begins on Friday, July 1, 2016 19:00 MSK and will run for 3 hours. Check it in your timezone

The problems have been set by me and tested by Lewin, who has also prepared a resourceful set of Editorials.

A lot of you can manage to solve all the 6 problems in 3 hours, for sure. However, I am pretty sure that it won't be that easy.
The order of the problems will be random. Each problem is worth 100 points but scoring is partial so try to pass as many tests as possible!

The Problemset talks about the adventures of a little girl, Gudi. Hope you are able to help her across the challenges she faces.
Good Luck Everyone, wish you a great time.
See you on the Hall of Fame!

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

»
10 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
10 years ago, hide # |
 
Vote: I like it +7 Vote: I do not like it

20 minutes to go, good luck to everyone! :)

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

The problems were nice, though most are based on bruteforce (and isn't Hungarian Algorithm too hard maybe?), but the submission/scoring issues were very annoying.

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

Can anyone discuss his approach for this problem : https://www.hackerearth.com/july-easy-16/algorithm/gudi-trapped-in-the-room-july-easy/ . Thank you!

→ Reply
  • »
    »
    10 years ago, hide # ^ |
     
    Vote: I like it +6 Vote: I do not like it

    I made a bruteforce with priority queue, so that smaller strings were expanded faster. My intuition was that if there are a lot of reachable states, then it quickly will find zero state and stop.

    → Reply
  • »
    »
    10 years ago, hide # ^ |
     
    Vote: I like it +14 Vote: I do not like it

    Brute force. At each stage you have two choices, either do the first operation or second.

    → Reply
  • »
    »
    10 years ago, hide # ^ |
     
    Vote: I like it +10 Vote: I do not like it

    Brute forced it, wrote a recursion and used a map to check if the string is already reached (kind of like bfs). One catch is that H can be greater than N so just replace H with H%N.

    → Reply
»
10 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Where are the editorials? There is nothing in the editorials tab. Please post them soon.

→ Reply
»
10 years ago, hide # |
 
Vote: I like it +21 Vote: I do not like it

Had all the p2 been rejudged? It seems that those submitted around 30mins all only has 90 points.

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

Apologies for the delay, the leaderboard has been fixed. And all the problems have been rejudged! :)

→ Reply
  • »
    »
    10 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    See comment by Deemo below. I also have the same problem still. I had all tests passed but zero score, and still have 0 for the last problem.

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

My solution passed every test case of the last problem, but my score is 0. this was definitely the worst hackerearth contest I've participated in. :)

→ Reply