Contest Experiences | Codeforces Contest 900 (Div 3)

ABOUT THE CONTEST:

• In this Contest, there are a total of 7 problems, and 2 hours and 15 minutes are given to solve this problem.
• For each wrong submission, there was a 10-minute extra penalty.

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

My Experience:

I was able to solve 5 problems out of 7 problems in these contests.

OVERVIEW OF ALL CONTEST PROBLEM:

Problem Name	Difficulty	Approx. time to solve	Number of submissions by me
A. How Much Does Daytona Cost?	Easy-Medium	5-10 min	1
B. Aleksa and Stack	Easy-Medium	5-10 min	1
C. Vasilije in Cacak	Medium	10-15 min	2
D. Reverse Madness	Medium	10-15 min	2
E. Iva & Pav	Medium	20-25 min	1
F. Vasilije Loves Number Theory	Hard	–	–
G. wxhtzdy ORO Tree	Hard	–	–

LET’S DISCUSS THE QUESTIONS:

Problem A. How Much Does Daytona Cost?

To solve this first reads the number of test cases (t), then iterates through each test case. For each test case, it scans the array elements, counts consecutive occurrences of the element k, and checks if the count exceeds the previous maximum count. If so, it updates the maximum count. Finally, it outputs “YES” if the maximum count is greater than 0; otherwise, it outputs “NO”.

Problem B. Aleksa and Stack

This code reads the number of test cases t, then iterates through each test case. For each test case, it initializes the array with the first three elements and constructs the rest of the array based on the pattern . The array is then printed as the output for each test case.

Problem C. Vasilije in Cacak

This code reads the number of test cases (t), then iterates through each test case. For each test case, it checks if the given conditions for choosing k distinct integers with the required sum are satisfied. If so, it outputs “YES”; otherwise, it outputs “NO”.

Problem D. Reverse Madness

This code reads the number of test cases (t), then iterates through each test case. For each test case, it performs the specified modifications on the string ‘s’ based on the given conditions and prints the final string after all modifications.

Problem E. Iva & Pav

This code reads the number of test cases (t), then iterates through each test case. For each test case, it precomputes the bitwise AND of prefixes and performs binary search to find the maximal index r for each query. The result is then printed.

Conclusion:

At the end I was able to solve 5 problem out of 7 problem. For me last two problem was difficult, I require more time to solve this last questions.
All the best for upcoming contest.