Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

anveshi's blog

Invitation to June Easy '18 on HackerEarth
By anveshi, 6 years ago, In English

Hello Codeforces community,

I would like to invite you to join HackerEarth's June Easy '18 which will start at 16:30 UTC, June 1, 2018.

The problems are prepared by jugnu and me and tested by trytolearn and akulsareen. I hope you'll find the problemset to be interesting.

You will be given 6 algorithmic problems to solve in 3 hours. Partial scoring will be used (you get points for passing each test case). Although the contest is targeted towards beginners, we hope even experienced problem-solvers find one or two problems to be interesting. The contest is rated and prizes will be awarded to the top 3 beginners(i.e. programmers with a rating of 1600 or less before the challenge starts).

Good luck & have fun!

Update-1: The contest starts in 10 minutes. Good luck to everyone :)

Update-2: Contest is over and editorial is up. Thanks to all the participants. Feedback about the problem set is welcome :)

Congratulations to the winners. Here is the top 10
  • Vote: I like it
  • +46
  • Vote: I do not like it

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

Can u start the contest a bit late, it clashes with Div.3 Codeforces!!

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

Nice Questions. I liked the mesh problem and last one especially the property(sad for not believing my intuition though).

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

    I doubted that at first too, so I wrote a program to confirm that graphs in the test data were bipartite. Haha.

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

    Glad that you liked the problems, I guess most of the people solved it by intuition (without proving the bipartiteness)

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

      I did a simplified proof by analyzing the parities in a2 + b2 = d2 during the contest. Perhaps this is where the 43 seconds came from :(

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

        Losing the first spot by mere 43 secs in just unfortunate. nonetheless, I hope you enjoyed proving it. congratulations:D

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

      Though a not related question. How to disable tags in hackerearth for practice purposes.

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

For the problem Mosquito Mesh , did anyone try solving using this approach ?

Calculate the total number of paths from (0, 0) to (n, n) and then subtract the number of abandoned paths( for each hole separately ) from this.

→ Reply