Calling all coders!
Get ready for the thrilling Competitive Programming Contest of NITS HACKS 6.0 in association with Coding Club NIT Silchar, under the event Tecnoesis, of NIT Silchar. The thrill and fun of team contest is back, with exciting prizes!
The coding competition is open to all undergraduate programmers in India, although everyone is encouraged to participate in it. It will be split into preliminary and final rounds according to ICPC guidelines (both rounds will be online). The final round awaits the top 30 preliminary teams out of which 10 spots are reserved for NIT Silchar Teams (excluding the top 20).
Rules:
A team of 2-3 members from the same college is required to participate in the contest.
An eligible individual may join only one team.
Each participant must have a Codeforces account.
A team must be created in Codeforces composed of the members.
Finally, you should register for the contest using the formed team.
The team must also register through the link provided below, not adhering to this requirement will make the team ineligible for winning prizes.
Registration Link:
Link: https://nitshacks.tecnoesis.co.in/event/3
Contest Time:
The Preliminary round will be on 1st February 2024 at 21:00 IST of duration 2:30 hrs.
The Final round will be held on 3rd February 2024 at 16:00 IST of duration 3 hrs.
Contest Link:
Click on the link below to take part in the contest. Registration for the contest will start 6 hours before the contest.
Link: https://codeforces.com/contestInvitation/629b54783ea94dadb04e65dbb6dcaa6d9897dd0d
Many thanks to all the people who made this round possible:
sroid_03, sahaagraz123, rainb0ySimp, SkyWalkerPS, Amartya3, Darpan2002 for authoring and preparing the problems.
Jo3kerR, _Dimpal_, he_rock18, trilasha_14, and also someone who doesn't want their name mentioned, for testing and providing detailed feedback.
MikeMirzayanov for the amazing Codeforces and Polygon platforms.
See You on the leaderboard!
UPD1: Registration has started.
Finally NITS HACKS is back after so long...Excited!!
Excited!! 🤩
Excited for the contest!!!
Finally after more than a year! Finally one more
Thrilled for my first NITS HACKS !!!
Excited for the contest!!
Excited!!!
Excited!
Excited!!
Do you have older NITS Hacks problemsets?
Hope this helps: https://codeforces.com/blog/entry/107549?#comment-959474
What's the deadline to fill the g-form?
You can register anytime before the prelims.
Excited!!!!
Is single participation allowed?
Yes, you may participate as a one-person team. However it won't be considered as an official participation.
Excited for my first NITS hacks coding contest
Are participants from other country (other than India) eligible for prizes?
As per rules, only Undergrads in India are eligible for the prizes.
have any previous question for practice?????
You may refer to this link: https://codeforces.com/blog/entry/107549?#comment-959474
Tnx-:]
Back after sooo long.... EXCITED!!!!
If I rank within the top 20 on the general list, does this automatically make me one of the top 10 NITS teams, or are the top 10 from NITS determined separately? In other words, will there be more than 10 teams from NITS advancing to the next round, or is the top 10 from NITS a distinct category?
You are a good question.....!!!
Great question! Ranking within the top 20 on the general list is definitely an impressive feat and puts you in a strong position in the competition. The determination of the top 10 NITS teams is indeed separate from the general top 20 teams.
It's important to note that while the top 10 from NITS are highlighted separately, there can be obviously more than 10 teams from NITS advancing to the next round.
All the best Anupam, see you in the ranking list
woohh......Excited
NIT Silchar orz
Are dual degree students eligible for prizes?
Yes
Excited!!!
Is individual eligible?
You can participate, however you won't be considered an official participant.
I think you should extend the team to at least 40-50 for a Rigorous competition.
According to current leaderboard till which rank the non-NIT Silchar teams get a chance for finals?
Top 20
It would be good if you could expand the limit :P
Test Cases were well prepared.
Hi, I agree that most of the problems testcases were pretty nice and also fell for that case in spoiler. Problems were fun and some were a bit troll in good way.
But before ending of contest, I was a bit frustrated with my code for $$$B$$$, and eventually I submitted my code with $$$O(K * K)$$$ loop in my $$$DFS$$$. So overall I think the Time Complexity of my code is $$$O(N * K * K + N * log(N))$$$ which should have not passed.
Submission
EDIT:
1
2 100000
1 2
1 1
1 2
It Leads to TLE
Test cases are weak for $$$H$$$.
[submission:244485212] can someone provide a counter example to this submission , for problem A. Its giving wrong answer for x=26 , in Testcase 2 , for every thing else its giving the correct answer , any reason/mathematical proof?
I have a confusion in question "B. Dora The Explorer", question guarantees that the given graph is a directed tree meaning every vertex should be reachable by the root (right?). But that is not true with some of the test cases. Many teams got wrong answer because of that. Is that test case correct? (test case 49)
They considered that, if an edge directed upwards(towards root) then the subtree below that edge as unreachable.
i got so much penalty because of this , otherwise my team is in top 20
Mine too :/ failed by 3 ranks
By the definition provided in the link, we gave in the statement of question "B. Dora The Explorer" which we believed is accurate (source: Wikipedia). Our problem is totally based upon that definition of directed tree.
Yes you are right, thank you for clarification.
Problem $$$C2$$$ could be made a little harder that may focuses on Suffix Automation by saying a substring wouldn't have more than maybe $$$X$$$ occurrences in total so that the whole problem could be solved in $$$O(N * logA + Q * X)$$$ where we could keep $$$X = sqrt(N)$$$ for betterment.
I do it with hashing so it didn't affect my code then also ig
you might have iterated over whole string? for each query it would be $$$O(N)$$$
Via suffix automation (suffix array) we can iterate over only occurences so that will take $$$O(X)$$$ per query where $$$X$$$ is the maximum occurrence
Yaa got it I don't know much about suffix array, I solved less problem on it ~2 3 problem I look how it work for finding this thing Thanks for the idea
Ohh means you say like q.n constraint can be reduced right
Yeah we can keep $$$Q*X \le 5 * 10^7$$$
The round was Awesome! Will the editorials be released? Also can someone explain A please?
if you do it directly , you get wrong since 10^x is always not divisible by 3. You should minus the remainder then you get the correct answer
Got it. Thank you!
Does this mean for (a/b)%M, when b divides a, then we can write it as (a%M / b)%M and then use MMI?
Understood. Thanks for the explanation
can you share some articles or blog for it so i can learn in more better way . Videos or tutorials I have watched or read till now on MMI didn't use this technique that u used even when a%b!=0 i.e 100%3!=0 here.
This is not a technique , actually question wants the floor value , so i need to remove the remainder IN other cases no need to do that actually
You can check the cp algorithm for MMI
okay got it but how did you realise that you have to remove the remainder?
where is editorial????
It will be released after the finals.
how i solve G "https://codeforces.com/gym/496831/problem/G" ?
Binary search
Tnx -:]