Codeforces Round 1101 (Div. 2) : Personal Analysis

Revision en2, by kartik.kumar.190305, 2026-05-31 08:36:39

Performance Analysis

I believe I did pretty good for my first contest. I have recently started working on this platform and have set an ambition to reach Legendary Grandmaster.

Coming to the analysis part.

A. Convergence

The problem was based mostly on logical reasoning and figuring out the pattern. Firstly we had to sort the array then choose a target number (location) where all the friend would meet.

To figure out the location choose a number and figure out how many friends are on the left side of that number and how many are on the right side. Do this and figure out the number with optimal left and right side values. '

That's it..!

B. Cake Leveling

This was a problem based on figuring out the mathematical form and pattern recognition in some sense. we had to find the optimal height of frosting at each index.

To do that first store the current sum of the height of frosting, then figure out the average based on the index (we can think of it as layer of the cake Ex. 1st Layer...) and current sum of the frosting, to figure out the optimal height of frosting.

Next, the minimum of average calculated of current level and average of previous level, to manage the excess frosting problem.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English kartik.kumar.190305 2026-05-31 08:43:54 0 (published)
en5 English kartik.kumar.190305 2026-05-31 08:43:15 648
en4 English kartik.kumar.190305 2026-05-31 08:42:06 652 Reverted to en2
en3 English kartik.kumar.190305 2026-05-31 08:41:37 652
en2 English kartik.kumar.190305 2026-05-31 08:36:39 1034
en1 English kartik.kumar.190305 2026-05-31 08:23:29 283 Initial revision (saved to drafts)