Hi everyone,
The second Indian ICPC Amritapuri onsite regional round will be held tomorrow in Bengaluru, Coimbatore and Kollam.
We plan to host a stream covering the round. The stream links will be posted shortly. The problems will be posted in this blog when the contest starts. The editorial will be posted after the contest ends.
Hope you enjoy the contest!
Contest Details
- Public ranklist Link — ICPC Amrita Website
- Date & Time — 29 December 2024, Sunday, 9:00 IST (Tentative start time)
- Duration — 5 Hours
- There will be 8 to 20 problems to solve
- Problem statements — Google Drive
- Will follow standard ICPC scoring system (20 minutes penalty and 1 point per problem)
- The questions may not be sorted by difficulty
- Stream link — Codechef Channel AryanC Channel
- Mirror streams on — CodeChef and aryanc403 channel
UPD : The stream has started and the problem statements have been released on this Google Drive
UPD 2 : The editorial has been uploaded in the same google drive as above.
UPD 3 : I also forgot to the post the ranklist. It can be found on ICPC Amrita Website. Congratulations to the Top 3 teams!
- Rank 1 : Ice Shard, CMI (10/12) : sheercold, Sid0309, Codula
- Rank 2 : on_the_spectrum, IITD (10/12) : MridulAhi, BladeRunner, etherinmatic
- Rank 3 : 404_solution_not_found, IITI (9/12) : nishkarsh, sai-17, P.V.Sekhar
UPD 4 : The jury solutions are also now available on the drive.
8-20 problems why do I have a feeling there's gonna be 14 problems tomorrow O-O
Why not 20 :)
Would be shits and giggles if we kept only 8. :P
ranklist please
Could you please share the ranklist
Please share Problem Statements as well.
Is there a public ranklist for this round? The link in the stream (https://www.codechef.com/ICPCAMROS24) is inaccessible to the public(?).IIRC we could view ranks on codedrills last time.
Solutions for L and K?
In K, i was able to get a diophantine equation with some inequalities and a variable to minimize.
In L, i don't have a proper proof but i believe we can calculate answer for different levels independently and maximize the sum at each level.
We will post thr complete editorial soon (after the closing ceremony), give me some time
When will the final ranklist be published ?
It will be published today.
Still not released or ami missing something ?
Daldo sir :)
UPD: Found my mistake
dp[i7][i6][i5][i4][i3][i2][i1]
whereij
is no of yet to be decided losing teams injth
round.ij <= 2^{7-j}
$$$O(2^{21})$$$ states per testcase, 7 transitions for each state.
We start with
dp[1][0][0][0][0][0]
Transitions looks like following
dp[i7][i6][i5][i4][i3][i2][i1]
->dp[i7][i6][i5-1][i4+1][i3+1][i2+1][i1+1]+(1+2+3+4+5)*aj
, notably we do not need index in dp state.Thanks
Would be great if you could create a gym from the problem statements and the actual tests!
Yeah that would be great if someone does so
Did you find any gym contest using these problem statements?
when will final RankList be Published? Can u upload RankList now?
Nice contest, waiting for the ranklist :)
Couldnt make it to the regionals this time but next year for sure!
Can we please have the final ranklist ?
Can we have the questions in codeforces pls :)
Can someone explain how to solve question D ?
It was discussed on stream
Final rank list : here
any update on the editorial, Dominater069?
Any hint to solve problem E?
Let $$$l(i)$$$ be the index of the leftmost element with value at least $$$i$$$, and $$$r(i)$$$ be the index of the rightmost element with value at least $$$i$$$.
$$$f(h)$$$ is equal to $$$\sum_{i = 1}^{n} (r(i) - l(i) + 1) - \sum_{i=1}^{n} h(i)$$$. (Think about raising the level of the rain gradually, and see the segment of indices covered at each step).
To find the expected value of $$$f(h)$$$ over all permutations of $$$h$$$, you can find the sum of the expected value of $$$r(i) - l(i) + 1$$$ over all permutations, for each $$$i$$$.
Thank you for the hint.
Hey can you share your code for E , I want to stress test mine.
code
Will we get the amritapuri editorial before the chennai regionals ?
soja bhai nahi milne wala editorial
[user:Dominator069]Can you explain the solution for Problem K : Max Mod
I am really sorry for the delay. The editorial has been uploaded. I will upload the jury solutions soon.
I am not completely sure, since, i am not that knowledgeable about the topic but i think K can also be solved using continued fractions.
Can you please create a gym contest of the above amritapuri contest? Dominater069
great thing.