Hello Codeforces!
We are glad to introduce IISc AlgoRush, an ACM ICPC-style programming event as a part of Rhapsody'22 (IISc's Mega Annual Fest)
IISc AlgoRush consists of a preliminary online round cooked in the kitchen of CodeChef, followed by an on-site round to be held at the IISc campus with exciting cash prizes worth Rs 50K.
The preliminary online round will be held on 28th June 2022, 10:30 PM — 29th June 12:45 AM IST.
The top 15 non-IISc teams and top 10 IISc teams will be invited for the on-site final round to be held on 8th July.
A team can have at most two members. To be eligible for the final round, the participants must be students of the same Institute/School (recent 2022 batch pass-outs are eligible).
Cannot attend the final round? We have prizes for the top 2 teams in the online round. (No eligibility criteria for the online prizes)
Register your team with your programming buddy (if !404) and start planning your trip to IISc. Don't forget to share this invitation with your friends and ask them to compete with you.
Register Contact Information here: Registration Form
For further details and registration, please visit the contest URL: IISc AlgoRush
The contest is set by me (MayureshPatle), playing_it_my_way, NeverGiveUP1997, and bigboxer851.
See you all on the Leaderboard!
(UPD1)
Hi Codeforces! As IISc AlgoRush was clashing with Codeforces Round #803, we have decided to postpone the contest by 1 hour and 30 minutes. The updated time for the same is 28th June 2022, 10:30 PM — 29th June 12:45 AM IST. We regret the inconvenience caused, and hope to see you all on the leaderboard.
Good Luck, and Have Fun! :)
(UPD2)
Thank you all for participating in the contest! Hope you all enjoyed the Problem Set! We shall be reaching out to the teams separately those who are qualified for the on-site round at IISc Bangalore. For being eligible to attend the onsite round please fill this Registration Form latest by tonight i.e 29th June 2022
Thanks Again!
Clashes with Codeforces Round #803, can you do something about it please ?
I really want to participate in this.
Yes, we are planning to reschedule. I will update the details once the decision is made.
Did you decide?
Yes
The online round on 28th begins during the contest duration of Codeforces Round 803 (Div. 2).
Could the online round be preponed by a few hours or maybe held on the 29th of June instead? Please look into this Mayuresh MayureshPatle and Varad playing_it_my_way.
(Also sent a message regarding the same on your numbers given on the contest banner at the CodeChef contest page)
We are planning to reschedule the contest due to this clash. We cannot postpone the contest to after 28th. We shall confirm soon about the updated timings and update the post, once the decision is finalized.
"ACM ICPC-style programming event", then a team should have 3 members right?
is this only for ug/pg students or can school students participate as well?
School students are allowed to participate.
Auto comment: topic has been updated by playing_it_my_way (previous revision, new revision, compare).
What's the closing time for registration?
Registration is allowed till the end of contest.
The CF contest ends at 10:20 PM IST. There's still a 5 minute overlap. Would it be possible to postpone it further by 10 minutes?
Sure
Which of these do the "no eligibility criteria" refer to:
Team members being from same college.
Team members still being students.
Suppose an eligible team qualifies, will both team members have to attend the onsite, or is it fine if only one attends and participants on their own.
Also, by any chance, would it be possible to participate with an ineligible teammate for the online round and then have one participate solo in the onsite?
"No eligibility criteria" refer to both the points you mentioned.
Yes, both members should attend onsite. Otherwise, it would be like someone taking help from another person to qualify for the onsite round.
No, for the same reason mentioned above.
what the actual fuck is this contest?
no latex for some statements, unnecessarily long statements.. wtf!
How to solve last problem? Tried (digit + bitmask) dp and tried to take care of leading zeros (and including it as digit too) but failed, also can you unlock problems?
Yeah, that's what we did as well. You might have missed some edge cases. You can check out the code here https://ideone.com/7qJerO.
That was the expected solution
We will make the solutions public ASAP.
Was C just bruteforce for every instance??
Yes.
Auto comment: topic has been updated by playing_it_my_way (previous revision, new revision, compare).
Can someone provide a test case where my solution is failing for 2nd problem? https://www.codechef.com/viewsolution/67963510
$$$O(T \times K)$$$ solution will get TLE!