pkmntrainerneh's blog

By pkmntrainerneh, history, 2 months ago, In English

CodeClub, IIT Kharagpur presents to you CodeNite 2021, an ICPC styled team competitive programming contest to provide an exciting learning platform and showcase your CP skills. The contest is sponsored by Coding Ninjas, one of the best learning platforms in India.

Problem setters and testers: anubhavdhar NehaDalmia pkmntrainerneh mi_ni_ rrohit4077 rajatbachhawat shivanshshukla60 prerit_paliwal

There will be two rounds of the contest. The first round is scheduled to be on Saturday 9th October, 7:30-9:45 PM IST. The top 30 teams will qualify for the second round to be held in the first half of December. The best 6 KGP sophomore teams will qualify regardless of their position.

The top 3 teams and the best KGP sophomore team in round 2 would win prizes worth Rs 4500 with exciting goodies! All the registered participants will get discount coupons by Coding Ninjas. Grab this amazing opportunity and register your team using the link http://tinyurl.com/CodeNite2021 by Friday 8th October, 6PM! There must be three members in a team.

See you all on the LeaderBoard!!

Only College Students are allowed to participate

Prizes can only be shipped within India

The results are out!

The list of qualifying teams can be found here

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

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

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

»
2 months ago, # |
  Vote: I like it +7 Vote: I do not like it

Contest is open for all colleges right?????

»
2 months ago, # |
  Vote: I like it +17 Vote: I do not like it

Hope it turns out to be a great contest! Looking forward to it.

»
2 months ago, # |
  Vote: I like it +11 Vote: I do not like it

Can't I register without forming a team...like an individual contest? ?

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

    Sorry but we have restricted it to ICPC style. 3 members are necessary...

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Is it required that all the team members belong to the same college.

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

What is KGP sophomore?

»
2 months ago, # |
  Vote: I like it +12 Vote: I do not like it

the round will be held where? platform ?

»
2 months ago, # |
  Vote: I like it +13 Vote: I do not like it

Can we know the total number of problems?

»
2 months ago, # |
  Vote: I like it +14 Vote: I do not like it

Is it possible to register now ? I would be glad if you can open the gforms once again

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Got your mail regarding the submission of solutions, just for clarification I wanted to ask, there will no plag check of solution from same team right?

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Huge

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Due to request made by few people, form is accepting responses till 1pm today. If you want to register, register asap!

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

In which site will the contest be held? Any links?

  • »
    »
    2 months ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    U will receive a mail regarding details after u register. Contest will be held on HackerRank.

»
2 months ago, # |
  Vote: I like it +11 Vote: I do not like it

Sir,

Our team still hasn't received any mail yet, can you please check It once.

Team name:- Flugelite' Regards Vaibhav Singh Tomar.

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

contest is on hackerrank or CF??

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

nice

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve the problem 3 Dogs?

  • »
    »
    2 months ago, # ^ |
    Rev. 2   Vote: I like it +4 Vote: I do not like it

    Solve using bfs where the state is {node, number of steps % 3}.

    Update states as ans[adjacent node][number of steps + 1) % 3] = ans[current node][number of steps] + 1 normally using BFS to get the shortest unweighted paths.

    The answer we need is clearly ans[target node][0].

    Code
  • »
    »
    2 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Think of something like distance[vertex][edge count % 3]

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

How to solve Inter-Hall Courier Service? I suspect its flows but I couldn't think of how to convert the inequalities to a network. Or does just spamming simplex work somehow?

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

How to solve Mango Tree?

»
2 months ago, # |
  Vote: I like it +8 Vote: I do not like it

When will be the final leaderboard released?

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

We will be releasing video editorials soon, so stay tuned!!

»
7 weeks ago, # |
  Vote: I like it +14 Vote: I do not like it

I think "The Lock, The Tablet and the Scroll" is easier to think of with Suffix Automaton. You can find the number of occurrences of every substring in $$$O(N)$$$ using this. Since the suffix automaton forms a DAG, you can find the number of substrings ending at a particular state with DP. It's trivial to find the answer by combining this information. Code.

»
7 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
7 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
7 weeks ago, # |
  Vote: I like it -29 Vote: I do not like it

Another piece of round with a lot of bugs

»
7 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

pkmntrainerneh Tanmay414 shivanshshukla60 please atleast make solutions of others to be visible to everyone, what's the point in not making them visible?