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 shivansh1102 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
Auto comment: topic has been updated by pkmntrainerneh (previous revision, new revision, compare).
Contest is open for all colleges right?????
Yes it is
Yup yup
I think so.
Hope it turns out to be a great contest! Looking forward to it.
Can't I register without forming a team...like an individual contest? ?
Sorry but we have restricted it to ICPC style. 3 members are necessary...
Is it required that all the team members belong to the same college.
No as long as all are college students...
What is KGP sophomore?
IIT KGP is another name for IIT Kharagpur & sophomore refers to 2nd years
the round will be held where? platform ?
Contest will be on Hackerrank
Can we know the total number of problems?
There will be 8 problems
Is it possible to register now ? I would be glad if you can open the gforms once again
mail us at [email protected]
++ I just saw this blog ;-;
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?
Yes
Huge
Due to request made by few people, form is accepting responses till 1pm today. If you want to register, register asap!
In which site will the contest be held? Any links?
U will receive a mail regarding details after u register. Contest will be held on HackerRank.
Sir,
Our team still hasn't received any mail yet, can you please check It once.
Team name:- Flugelite' Regards Vaibhav Singh Tomar.
Do check the spam section once. My mail came into spam.
contest is on hackerrank or CF??
Contest will be on Hackerrank
and link?
Moreover all the three team memberS have to login to their respective accounts or it will be through a single account
All can log-in but submit thru only 1 account
https://www.hackerrank.com/codenite-2021-round-1
How to solve the problem 3 Dogs?
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].
Think of something like
distance[vertex][edge count % 3]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?
I suspect it can be solved using simplex.
Edit: After some minor changes and printing errors simplex ACed.
Code: Link
On that note, anyone know a good simplex template for competitive programming?
Commenting for better reach. xD
https://pastebin.com/vehvCr2F
It can be reduced to maximum weight bipartite matching :). Then apply Hungarian Algorithm.
Yes :))
can u tell me why for n = 3 {1,2,3} is not valid in Planning Trips?
Because any three trips can't be increasing. Like, we need to avoid this condition:- a[i]<a[j]<a[k] for i<j<k for any array to be valid.
ok. thanks for making it clear.
How to solve Mango Tree?
We will release editorials soon!
1525C - Robot Collisions
You're welcome.
When will be the final leaderboard released?
We will release final leaderboard & editorial this weekend
editorial plz
We will be releasing video editorials soon, so stay tuned!!
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.
Auto comment: topic has been updated by pkmntrainerneh (previous revision, new revision, compare).
Auto comment: topic has been updated by pkmntrainerneh (previous revision, new revision, compare).
Another piece of round with a lot of bugs
What bugs did you encounter?
pkmntrainerneh Tanmay414 shivansh1102 please atleast make solutions of others to be visible to everyone, what's the point in not making them visible?
They are now visible for all along with editorials (except for first problem) Sorry for any inconvenience!
Link to Contest page