swapnil07's blog

Newton's Coding Challenge October 2022 Invite
By swapnil07, history, 2 years ago, In English

Edit: The editorials have been published.

Warm greetings and Happy Diwali everyone,

Newton School cordially invites you to be a part of our monthly coding contest. The challenge will go live on 27th October 2022 at 9 PM IST. The contest will be themed around Diwali, the Indian Festival of Lights!

Registration Link: Newton's Coding Challenge

You will be given 6 problems and 150 minutes to solve them. The contest will be rated for all!

The problems were written and tested by dnshgyl21, _deactivated_, Sawarnik, Xzirium, and _Enigma__.

We would also like to thank pradumangoyal and gkapatia for co-ordinating the contest.

Highlights of contest:

  1. The Prize Money for the top 5 performers are as follows:
    • First Prize: ₹10,000
    • Second Prize: ₹5,000
    • Third Prize: ₹2,500
    • Fourth Prize: ₹1,500
    • Fifth Prize: ₹1,000
  2. ₹100 Amazon gift vouchers to the top 50 participants.
  3. ₹100 Amazon gift vouchers to 50 randomly selected participants ranked between 51-500.

Note: Top 5 participants from other countries can opt to receive the prize money through Paypal. All the other gift vouchers will be sent in INR. There might be a slight delay in processing of international prizes.

We hope you all shine bright in the contest! See you all at the leaderboard! :)

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

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

Any plans to update the prize distribution scheme?

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

The part i hate about newtons contest is the so steep increase in difficulties of problems rest the problems are nice

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

    Thanks a lot for the valuable feedback. We will try to incorporate in the future rounds.

    Please expect and updated prize distribution from next contest! :)

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

      Where are the editorials published? I like the problems but I can't find the editorials of previous $$$2$$$ contests

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

        Hey,

        Here's the link for August contest editorial: https://codeforces.net/blog/entry/106545

        We could not publish the editorials for the Sept coding contest due to ongoing ICPC rounds, but you can expect the editorials of this contest to be published by weekend.

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

Rated means Will it give any effect on Codeforces rating or open for all and won't effect codeforces rating ?

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

    It will affect ratings on Newton School platform only! :)

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

If you could provide editorials to some of the harder problems that would be great.

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

Since, I can't find any section to ask for clarification, I am asking it here,

In problem C, for the 1st testcase, can you explain how is (3) a maximal path, but not (1) or (2) ?

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

    A path (v1, v2, ... vk) in the graph is called maximal, if for any vertex v, the sequence (v, v1, v2, ... vk) or (v1, v2, ... vk, v) do not represent paths in the graph.
    This basically means that:
    v1 should not have any parents && vk should not have any children.

    Graph

    So in the 1st testcase:
    (3) is a maximal path because it does not have any parent or children.
    (1) is not maximal because it has a child (i.e 2)
    (2) is not maximal because it has a parent (i.e 1)

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

      Thanks for the explanation, I initially thought that v is some vertex from the set (v1, ... , vk), but it is some general vertex from the graph.

      PS: During the contest, I thought it should use some toposort idea, so I made some random solution by guesswork, and luckily it passed xD. Seriously, I had no idea what the Q even meant, until your comment.

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

Can anyone please explain how to do 2nd question .

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

Problem Statement of C, is so hard, till end of the contest was not able to think what was it asking for, please from onwards add example or figure for better understanding.

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

Auto comment: topic has been updated by swapnil07 (previous revision, new revision, compare).

→ Reply