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

Автор Dominater069, 5 месяцев назад, По-английски

We invite you to participate in CodeChef’s Starters136, this Wednesday, 29nd May, rated for till 6-Stars(i.e. for users with rating < 2500).

Time: 8:00 PM — 10:00 PM IST

Joining us on the problem setting panel are:

Div1 will have 6 problems. Div2, Div3, Div4 will have 7 problems.

Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here. Hope to see you participating.

Good Luck!

UPD : Sorry for the issue in XORNE0.

Top 5 :

  1. maspy

  2. aryanc403

  3. duongnc2

  4. sevlll777

  5. leaf1415

  • Проголосовать: нравится
  • +78
  • Проголосовать: не нравится

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

I have submitted a problem idea around 20 days ago how long does it take get a response of rejection or selection of idea

»
5 месяцев назад, # |
  Проголосовать: нравится -11 Проголосовать: не нравится

Dominater round

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

what's the solution for rectangle game

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

Can anyone tell me , why this code is getting TLE? for problem code : LEXMAX

My code
  • »
    »
    5 месяцев назад, # ^ |
    Rev. 2   Проголосовать: нравится +3 Проголосовать: не нравится

    you have to remove all the elements simultaneously that gives max B[i]
    suppose B[i — 1] = 5 and max possible B[i] is 5 then you have to remove 3 and 1 in one go
    there can be multiple distinct elements which lead to max B[i]

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

      Wow , Thanks :) FML , feels badge

      AC CODE
»
5 месяцев назад, # |
  Проголосовать: нравится +7 Проголосовать: не нравится

GAMERECT is very similar to this problem 104666D - Crimson Sexy Jalapeños

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

Problem B video Editorial : (Sum of Modes) YOUTUBE VIDEO LINK --Click Here

»
5 месяцев назад, # |
Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

Problem C LEXMAX

I got a WA on (third test) task 2 using tries for finding most compatible remaining element 2nd index onwards

https://www.codechef.com/viewsolution/1062347572

Can anyone point a test where it fails ( Codechef premium allows that ) ? Thanks

  • »
    »
    5 месяцев назад, # ^ |
    Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится
    test case
    correct output
    your output

    you can learn about stress testing here

  • »
    »
    5 месяцев назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Here's a failing case: 1 7 11. Your solution gives output 11 1 1 while the actual answer is 11 3 1.

    The place where the solution goes wrong is in the query function: when curBit is 0, it preferentially traverses to the left child. However, elements of the right child should also be checked.

    I'd also attempted using tries initially, but ended up with a simpler approach. Submission

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

In the rect game problem , It is interpreted as a nim game. Can someone clarify the following doubt "Say I have 2 piles and two players are playing game of nim on it. Now if the first player has a winning strategy on both then as per theorem we know 1st player loses. But say 1st player plays a move such that after his move the state of both piles remains same i.e. both piles still remain in winning state and player 1 might win this way."

»
5 месяцев назад, # |
Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

Is Problem SUMKMAX that easy? How did so many people in Div-2 and Div-3 solve this problem as compared to LEXMAX, which I thought was fairly easy. In Div-1, LEXMAX was solved by almost 3 times more contestants, but in Div-2/3 it is the opposite? Can't understand.

  • »
    »
    5 месяцев назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    SUMKMAX has a one liner solution using some weird factorials, Not tough to guess that solution was floating in cheating groups.

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

Thank you so much for this amazing contest! I became 4* coder in this contest!!