Hi everyone,
The ICPC Kanpur onsite regional round is ongoing from 10 AM IST to 3 PM IST. You can follow the public ranklist here
UPD1:
A mirror will be conducted on CodeChef this weekend. The exact time and the contest link will be updated later. The editorial will be posted after the mirror.
The problems were authored by: IceKnight1093, wuhudsm, jtnydv25, jeroenodb, nifeshe, and satyam343.
Special thanks to our testers: (thawin.ice, ttamx, temporary1), nifeshe, (Karuk, BLOBVISGOD, jeroenodb), (blitztage, Kira_1234), catgirl, _runtimeTerror_, SmolBrain, aryanc403, JagguBandar, (Proof_by_QED, cry, and Lilypad).
Congratulations to the top 3 teams!
Rank 1: Div4Maxxers (IIT Kharagpur) (9 / 11): Dominater069, Aryan-Raina, _ar07
Rank 2: Malai Chaap Extra Masala (IIT Roorkee) (8 / 11): Divine_Spark, Prady, Rodger2041
Rank 3: just_better (IIT Bombay) (8 / 11): Sam_2027, DustOfSnow, Kritin
UPD2:
We invite you to participate in ICPC Kanpur 2025 Onsite — Replay Round (Unrated), this Saturday, 27th December.
Time: 10:00 AM — 3:00 PM IST
Is the problemset public? If yes, where?
public problemset ??
Release the public problemset.
When will the editorial be out
Do you have the problems??If so kindly share it :)
yes please share it .
I don't have the soft copy
scan the copy after that upload in Gdrive and share the link
Which problems did everyone found most interesting/toughest/tricky? Please share problemset link if available.
Minimize Minimum, was most interesting problem for me
What was your team's solution for Minimize Minimum?
Let the given array
abe of lengthn. We decompose it into two sequencess₁ands₂, each of lengthn / 2.For every index
i(using 1-based indexing): - The value ofs₁[i]is fixed asa[2i]. - The value ofs₂[i]must be chosen from the subarraya[i … 2i − 1].At index
i, to minimize the contribution, the best choice fors₂[i]is the element whose value is closest toa[2i]. Any other choice would lead to a larger cost and s2[i] will lie in the range[i ... 2i - 1]we can solve it efficiently using multisetAs the only blue tester, problemset is pretty interesting!!
Problem Statement
Thanks for sharing!
Release in cf gym
prady is orz great tutor great cp skills !
In problem J — Recursion was The final formula c(i+j,j) please confirm or deny..
code url
https://pastebin.com/XBYLcpcT
no ;)
Let $$$f_k(x)$$$ denote the value after $$$k$$$ steps. Then
Therefore, the difference satisfies
Let
If $$$r = 0$$$, set
since the indices are taken from $$$1$$$ to $$$n$$$.
Thus,
Recurence Relation
Finally, we obtain
Why do we first do
m = m % (n² − 1)?Please turn on practice mode for this problemset on codechef or some other oj.
Currently it shows 403 not available.
Also it would be great if you publish the editorial.
How to solve the problem H — Prefix Game? I came up with a logic, but it gives a wrong answer. Can anyone help me correct it?
I am mainly focusing on the "gap" condition, where v[i] — v[i+1] > 1, or v[i] == v[i-1].
I treat such cases as gaps, and according to my observation, the player who encounters the first gap wins the game. Can someone explain why this logic fails or how it can be corrected?
Yes, you are on right track with gaps.
You see whenever you make a move on certain prefix $$$i$$$, you decrease the gap between $$$i$$$ and $$$(i + 1)^{th}$$$ pile.
So, every move only changes a certain gap
Whenever gap between two piles becomes 0, we can consider them as a single pile
So if we transform the array of piles into array of gap between piles, Then on each move a player can only decrease a single point in the gap array. A player would need to decrease atleast 1 from a point in the gap array. The game ends when all the elements in the gap array becomes 0.
Sounds familiar?
The problem just got transformed into normal nim game. If you know how to solve a nim game then you would know how to solve this transformed problem as well.
Can you share your solution Link if possible?
https://pastebin.com/3cTQZBaL
Editorial
can you please turn on the practice mode.
Is it possible to get last year's regionals problemset and editorial?
I checked last year's cf blog and problemset and editorial link were missing
This is 2024 kanpur onsites , for 22 and 23 you can visit their website ->Link
where is the editorial ?
can anyone provide link for that ?
https://mirror.codeforces.com/blog/entry/149435?#comment-1335728