Contest Experiences | Educational Codeforces Round #150 (Div. 2)

ABOUT THE CONTEST: Educational Codeforces Round #150 (Div. 2)

• This Educational contest was conducted by codeforces #159 for Div 2 Participants.
• In this Contest, there are a total of 6 problems, and 2 hours time given to you to solve this problem.
• For each wrong submission, the 10-minute penalty was there.

Link of the Contest: https://codeforces.com/contest/1841

My Experience:

I was able to solve all the problems in the given time of these contests.

OVERVIEW OF ALL CONTEST PROBLEM:

Problem Name	Difficulty	Approx. time to solve	Number of submissions by me
Game with Board	Easy	10	1
Keep it Beautiful	Easy-Medium	10	1
Ranom Numbers	Easy-Medium	15-20	2
Pairs of Segments	Medium	20	2
Fill the Matrix	Hard	25	2
Monocarp and a Strategic Game	Hard	25	2

LET’S DISCUSS THE QUESTIONS:

Problem A – Game with Board

To solve this we comparing each line as an integer to 5. Depending on the result, we prints characters from a predefined string in an alternating fashion.

Problem B – Keep it Beautiful

In this problem for each test case, we takes an integer ‘z’ as input, followed by a sequence of integers. This questions amis is to determine and print a binary string, where each bit indicates whether the corresponding element in the sequence can be included in a certain condition or not.

Problem C – Ranom Numbers

To solve this processes a series of test cases, converts characters in a string to numeric representations, explores different character swaps, and calculates the maximum numeric value that can be obtained by swapping a single character within the string. we repeats this process for each test case and outputs the maximum values.

Problem D – Pairs of Segments

To solve this we sorts tasks by their end times and then schedules as many tasks as possible by selecting the ones that don’t overlap with each other. The output is the maximum number of non-overlapping tasks that can be scheduled.

Problem E – Fill the Matrix

To solve this we use a stack and a suffix sum vector to calculate the maximum achievable sum given certain constraints and elements in an array for multiple test cases. The output is the maximum achievable sum for each test case.

Problem F – Monocarp and a Strategic Game

The solution processes a set of complex numbers, calculates the maximum squared magnitude of their sum, and prints the result. The key idea is to accumulate complex numbers in the first and fourth quadrants of the complex plane, which maximizes the squared magnitude of the sum.

Conclusion:

At the end of this contest I was able to solve all problem. For me last 2 problem E and F was difficult, I require more time to solve this two questions. All the best for upcoming contest.