Пожалуйста, подпишитесь на официальный канал Codeforces в Telegram по ссылке https://t.me/codeforces_official. ×

Блог пользователя anveshi

Автор anveshi, 6 лет назад, По-английски

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
  • Проголосовать: нравится
  • +46
  • Проголосовать: не нравится

»
6 лет назад, # |
  Проголосовать: нравится +6 Проголосовать: не нравится

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

»
6 лет назад, # |
  Проголосовать: нравится +32 Проголосовать: не нравится

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

  • »
    »
    6 лет назад, # ^ |
      Проголосовать: нравится +16 Проголосовать: не нравится

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

  • »
    »
    6 лет назад, # ^ |
    Rev. 2   Проголосовать: нравится +11 Проголосовать: не нравится

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

    • »
      »
      »
      6 лет назад, # ^ |
        Проголосовать: нравится +18 Проголосовать: не нравится

      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 :(

      • »
        »
        »
        »
        6 лет назад, # ^ |
          Проголосовать: нравится +16 Проголосовать: не нравится

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

    • »
      »
      »
      6 лет назад, # ^ |
        Проголосовать: нравится +14 Проголосовать: не нравится

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

»
6 лет назад, # |
  Проголосовать: нравится +5 Проголосовать: не нравится

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.