TLE's blog

Invitation to CodeChef April Long Challenge 2019 sponsored By ShareChat!
By TLE, history, 6 years ago, In English

Greetings Codeforces community!

I'm glad to invite you to participate in CodeChef's April Long Challenge sponsored by ShareChat. This long contest lasts for 10 days and will have 7 binary/subtask problems and 1 tie-breaker problem. This is a nice opportunity for everyone to increase your rating and climb up the leaderboard. The problem statements will be available in English, Hindi, Bengali, Russian, Mandarin and Vietnamese.

ShareChat — India's fastest growing social network is seeking both interns and full-time employees to join their dynamic team. Job opportunities are open to programmers across the world and internship opportunities are exclusively aimed at final year B.Tech students who have already been placed and looking forward to gaining startup experience. Visit the contest page for more details.

I hope you will join your fellow programmers and enjoy the contest problems. Joining me on the problem setting panel are:

  • Setters: raj1238 (Raj Shah), Sumit Jain, Ashishgup (Ashish Gupta), born.kira (Arun Gupta), Surya Prakash, Utkarsh Sinha, Jas Mehta, Deemo (Mohammad Nematollahi), taran_1407 (Taranpreet Singh), danya.smelskiy (Danya Smelskiy)
  • Tester: TLE (Zhong Ziqian)
  • Editorialist: adamant (Alexander Kulkov)
  • Statement Verifier: Xellos (Jakub Safin)
  • Russian Translator: Mediocrity (Fedor Korobeinikov)
  • Mandarin Translator: huzecong (Hu Zecong)
  • Vietnamese Translator: Team VNOI
  • Bengali Translator: solaimanope (Mohammad Solaiman)
  • Hindi Translator: Akash Shrivastava

Contest Details:

  • Start Date & Time: 5th April 2019 (1500 hrs) to 15th April 2019 (1500 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone
  • Contest link: https://www.codechef.com/APRIL19
  • Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.
  • Prizes: Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. First to solve each problem except challenge — 100 laddus. Know more here: https://www.codechef.com/laddu
    (For those who have not yet got their previous winning, please send an email to winners@codechef.com)

As usual, you can give your feedback on the problem set in the comments below, after the contest. Good luck and have fun! Hope to see you participating!

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

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

We shouldn't discuss problems until the end of the contest, but I will forget about it then, so fuck it.

WTF

What is wrong with its input format? Why don't we just have 10 independent tests of size 50, and only $$$A_{i} \cdot t_{i}$$$ in input? Why should we read $$$10^{6}$$$ numbers 90% of which are zeroes and only few thousands have meaning?

→ Reply
»
6 years ago, # |
← Rev. 2   Vote: I like it -8 Vote: I do not like it

https://mirror.codeforces.com/blog/entry/66434 was up throughout the contest.

I didnt get the solution so it didn't help me and no action seems to have been taken against it :/

EDIT: ignore

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

    Read the post carefully. That is a completely different problem than XORMIN. It is asking about maximum XOR in the path from root to a node, not in the subtree of a node. And why should you even expect someone to take any action against it, when in fact, that is a problem from a past round of CodeChef itself: MAY17 — GPD

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

      Oops! My bad — guess that explains why the 'solution' there didn't help me : )

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

        That is because you tried to follow the solution blindly without even understanding the problem. Or else who on earth would assume those two were the same problem.

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

SONIQUE is a boring data structure problem.I spent 5 min thinking,2h coding.

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

    How to solve query 7 ?

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

      Arbitrarily choose a node from each connected component that has at least one node $$$A_i>0$$$,maintain auxiliary tree of these nodes.

      → Reply