Ashishgup's blog

GeeksForGeeks Code India Code Finals (Open for all)
By Ashishgup, history, 2 years ago, In English

Hello Codeforces,

I am happy to invite you to the Final Round of GeeksforGeeks's Code India Code.

We don't want to exclude passionate programmers from enjoying the problem set of the final round. Therefore, the contest will be open for all users but only participants who passed in the Qualification Round held on 6th March will be eligible for the rewards.

Contest Details:

  • Finals Link: (Register Here)
  • Time: Thursday, 10 March 2022, 7:30 PM to 10:00 PM IST.
  • Number of Problems: 7 problems
  • There will be no penalties for wrong submissions.
  • Tie Breaker: Time to reach X points. (ie, time of last AC solution)

Prizes:

  • Rank 1: Macbook Pro + Course voucher worth INR 12,000
  • Rank 2: iPad Air + Course voucher worth INR 7,000
  • Rank 3: Smart Watch + Course Voucher worth INR 3,000
  • Rank 4-25: Tablets + Course Voucher upto INR 1500
  • Rank 26-100: Noise Earbuds + Course Voucher upto INR 1500
  • Rank 101-200: Noise Smartbands + Course Voucher upto INR 1500
  • Additional Reward for top 1000 participants: Free access GeeksforGeeks Premium Plus (Quarterly membership) with which you get: Access to ad-free content, Personal notes, free access to Doubt-Assistance program.
  • Prize distribution is limited to those residing in India only.

Problem Setting Panel:

Even though the prizes are only for Indians, I would like to invite others to participate — the problem-set contains interesting and challenging problems, with an estimated difficulty of a Div2 — Div1.5 round.

Good luck everyone. See you on the leaderboard!

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

Comments Comments (80)
| Write comment?
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can I participate, even I didn't participated in earlier rounds?

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

    Yes.

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

      GeeksforGeeks round 2 was on 10th March.

      Coding Ninjas CodeKaze round 2 was on 13th March

      Codekaze has more than 10 times participants than GeeksforGeeks Code India Code.

      Codekaze has much more prizes than GeeksforGeeks Code India Code.

      But despite all this Coding Ninjas declared the result of final round and sent mail. And soon within 1-2 days they will send prizes. On the other hand GeeksForGeeks is doing ....?

      And not even replying participants.

      Hope this better describes the difference between 2 platforms GFG and Coding Ninjas.

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

        Yeah, really impressed with coding ninjas . From Today onwards , I will Try to participate in Their weekend contests regularly .

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

        Problems of this GFG contest are more interesting than CodeKaze.

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

where did we find qualification round problem's solutions because those problems are really very challenging awesome and pretty hard also.

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

Any idea about which tablets for rank 4-25?

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

"only participants who passed in the Qualification Round held on 6th March will be eligible for the rewards."

Can This be relaxed?(the qual round was basically solving one <=div2c problem but I missed the contest)Someone who do perform well in finals has skill to clear qualification round anyways

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

    It clearly was not just a div 2 A problem when a CM solves B,C,D and fails to do the A problem. wink

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

The contest clashes with both Educational Round 124 and Reply Challenge. Is it possible to reschedule the contest?

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

Any updates on changing the timing? These timings should be discussed before checking all the major websites like codeforces, codechef and atcoder

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

In Leaderboard, only trusted participants(who solved >=1 problem in qualification round) are present or everyone who took part is present?

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

    Omja ??

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

      Everyone who took part is currently on the leaderboard.

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

        Just a small doubt, Whether prizes will be given according to global rank or rank among the Indian participants?

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

          top X ranks among the Indian participants.

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

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

In the problem Path Function, why are constraints on the number of queries (q) not mentioned?

→ Reply
»
2 years ago, # |
  Vote: I like it -51 Vote: I do not like it

jtnydv25 T-T

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

Would someone like to exchange a smartband with me for earbuds?

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

Plz share your ideas or solution on how you solved or approached the problems. It will be very helpful. Thanks in advance.

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

    Can anyone give some hint for 4th one?

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

      I can tell you about a $$$O(N)$$$ solution.

      Firstly let us rewrite the asked value
      $$$abs( x*ar[y] - y*ar[x] )$$$ {Now since in problem it is given that ar[i]%i==0 we can substitute ar[x] by $$$k.x$$$(k is a constant) , similarly we will replace ar[y] by $$$d.y$$$ (d is another constant)}

      =abs(x*y*d-x*y*k)
      = $$$abs(x*y*(d-k))$$$

      This shows that for any fixed d and k the best answer will be given by the lowest values of x,y possible.

      Now ignoring the above equation for some time, we change our focus. What can be he maximum number of distinct values of $$$ar[i]/i$$$ It is $$$√N$$$.

      Using this observation about the maximum number of distinct value we can brute force for all possible pair of values.

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

        Really nice soln. I missed it and ended up overkilling it using convex hull trick. It solves this problem in $$$O(nlogn)$$$ and $$$i$$$ divides $$$a_i$$$ constraint isn't required.

        Just one correction regarding time complexity, no of distinct values of $$$ar[i]/i$$$ is $$$O(\sqrt M)$$$ where $$$M=10^6$$$, maximum possible value in the array. For small enough $$$n$$$ we can create a testcase with $$$O(n)$$$ distinct such values, so resulting time complexity would be $$$O(n*\sqrt M)$$$, overall $$$O(N*\sqrt M)$$$, where $$$N=10^5$$$ is sum of values $$$n$$$ across all testcases.

        Looking at constraints, it is an intended soln.

        Worst case generator
        → Reply
      • »
        »
        »
        »
        2 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Can you explain a little bit how the maximum number of distinct values is sqrt(n)?

        → Reply
        • »
          »
          »
          »
          »
          2 years ago, # ^ |
          ← Rev. 3   Vote: I like it +9 Vote: I do not like it
          • The value of $$$A[i]/i$$$ when $$$i \geq 1000$$$ will be less than <= 1000 (since A[i] <= $$$10^6$$$). Thus, the number of different values is at most 1000.
          • The number of different values when $$$i < 1000$$$ is at most 1000.

          So, in total, the maximum number of distinct values would be 2000.

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

Hey there,

I know they have provided a video solution for the contest but I am stuck on problem D which hasn't been covered in the video solution. Could anyone please give me some hint or approach? Thank you.

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

    D was based on pigeonhole principle.

    Spoiler
    → Reply
    • »
      »
      »
      2 years ago, # ^ |
        Vote: I like it +4 Vote: I do not like it

      Can you explain a little bit about how the maximum distinct value of a[i]/i will be less than 2000 always. Did you get this value 2000 by checking for some big test cases,or, is it some intuition based. Please tell me what I am missing.

      Thanks

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

        We have a[i] <= 1000000 for all values of i. Now for i >= 1000, we can clearly a[i]/i <= 1000 because of the constraint a[i] <= 1000000. So between the indexes 1000 and 2001 , you have only 1001 distinct values of a[i]/i but there are 1002 indices so some value of a[i]/i has to repeat. So for n>=2001 we can guarantee that the answer is 0. I thing we can reach n>=2000 also using similar line of thought.

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

Minimize maximum elements can be solved by https://oeis.org/A036990 this series. During the contest, I wrote a brute force solution for n up to 10 and searched that series on OEIS and found the above series, but sadly I wasn't able to finish the code during the contest.

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

What was the solution for problem Path functions?

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

    Trick 5 and 6 here

    Looking at constraints I feel the intended soln is generating all $$$2^{20}$$$ possible basis (using just trick 6) and then doing TRIE+DFS maintaining subtree size for each query.

    But its solvable even for $$$w <= 10^{18}$$$ (and easier to code), adamant comment explains how to find kth largest/smallest no using basis.

    (Thanks, Utkarsh_Agarwal852 for bumping this comments in recent actions a few weeks ago ;) )

    [Code] Finding kth minimum using basis

    Full submission

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

      you got a good solution ..and i get added as a friend..deal :) ?

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

        You got him a tablet and you're satisfied only by being added as a friend, I wouldn't have settled for anything less than a smartphone at least.

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

When will the rank winners list be announced?

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

How to solve the third problem (Two Strings)?

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

Prize distribution/results when?

→ Reply
»
2 years ago, # |
  Vote: I like it -22 Vote: I do not like it

GeeksforGeeks round 2 was on 10th March.

Coding Ninjas CodeKaze round 2 was on 13th March

Codekaze has more than 10 times participants than GeeksforGeeks Code India Code.

Codekaze has much more prizes than GeeksforGeeks Code India Code.

But despite all this Coding Ninjas declared the result of final round and sent mail. And soon within 1-2 days they will send prizes. On the other hand GeeksForGeeks is doing ....?

And not even replying participants.

Hope this better describes the difference between 2 platforms GFG and Coding Ninjas.

GeeksforGeeks_admin Ashishgup AvinashKartik Utkarsh.25dec bunty_x i.am.pratik Omja manpreet.singh

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

    Hi! I was the problem setter for this round! If you have any issue with the quality of problems or any problem-related stuff, only then tag me.

    And I believe the leaderboard is final; we have removed the cheaters, you can find your rank here.

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

Will the contestants above rank 200 be included under 200 after removing overseas particpants. Ashishgup Omja

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

I'm actually quite curious to know how did namangoyal198 managed to cheat his way to the global rank 3 by beating so many ultra-skilled participants. Kudos to GFG team for catching him though.

CONTEXT:
Ranklist before Plag-check
Ranklist after Plag Check

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

    Maybe he was removed from leaderboard because he has not given/qualified round 1.

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

      No, we had removed him for plagiarism. The users who hadn't participated in the Qualification round are still on the leaderboard xD

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

      I doubt that, can you find these non-Indian LGMs on the qualification round ranklist: hitonanode and nirjhorjr ?

      Still, a stable newbie beating LGM's is quite fishy anyways (unless he is that mysterious anime character who was waiting for this day to unleash his true potential)

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

GeeksforGeeks_admin

11 Days passed we haven't got a single mail for conformation of prizes. Although GeeksforGeeks sends spam mails daily to participate in this/that event buy this/that course but when it come for prizes you ghost.

Atleast please reply if it will take some time you should not ghost.

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

Anyone else got a message to claim your prizes and then a message to ignore the previous email.

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

    I just got the message the claim to claim the prize but nothing of sorts of ignoring the previous mail.

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

      The next message about ignoring the previous mail came at 6:49 pm (IST) to my email address.

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

        Yes I got that too and hence did not bother filling up the form...But then onwards they sent no further mails regarding the prizes...

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

    It's probably because they used a wrong ranklist to give out prizes. I got a somewhat similar mail too, but that was because they earlier told me my rank was 3, but it was 4 instead (so the prize changed).

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

    After they sent the mail asking me to ignore the previous mail, today they sent a mail regarding course voucher. Did you get the mail regarding the prize?

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

      Didn't get the mail for the course voucher either. T.T

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

      I too recieved the 3 month premium free plan and that message asking to ignore the previous mail...But then onwards no further communication has been made from their side regarding the prizes....Seems like they are ghosting us

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

I solved 2 out of 3 programming questions and didn't even open the quiz part yet I got 3 months premium plus membership for free.

Thanks a lot :)

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

Is there anyone I can email or contact regarding my prizes?

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

GeeksforGeeks_admin Ashishgup AvinashKartik

Are you planning to give prizes or not ?

You just ghosted after contest no reply at all.

Learn from other platforms.

You can increase your audience by lots of promotion but you are definitely loosing many because of this trust related issues and you customer support.

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

    Some people have already started receiving prizes. Anyway, I am not associated with the prize distribution or logistics part of it — my job was to admin the contest, so I'm sorry about being unable to help there. I will try to raise the issue and have the GFG Admin reply instead.

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

    They sent a mail on the 21st about the goodies but after 10 mins they sent another mail telling us to ignore it...From then onwards no further communication has been made regarding the prizes...Seems like they ghosted everyone

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

    Did anyone received their prize? I got a mail for filling address details on 31th march but still did not receive my prize. GeeksforGeeks_admin can you please look into it.

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

      Same except that I didn't even get the email.

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

      I got my prize but instead of Noise Earbuds, I received Boat Earbuds.

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

        How??? Where did you fill up your contact details? We did not get any mail informing us to submit our details for getting the prizes

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

Now after almost 1.5 months I have not received my prize and a single mail about my prize. Atleast pls inform us about the status of the prizes.

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

    They ghosted everyone dude... Idk from where some people got their prizes but 99% of the deserving candidates have not got it till now.. Sets a really bad reputation for gfg.

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

    Same bro. Have almost given up on them.

    → Reply
»
23 months ago, # |
  Vote: I like it +8 Vote: I do not like it

anyone got their prize?

→ Reply
  • »
    »
    23 months ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    Yes I did. A couple of weeks back.

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

    Yeah...got a delivery agent suddenly deliver the smartwatch one day without any prior intimidation..

    → Reply