Contest Experiences | Codeforce Round: #874 (Div. 3)

ABOUT THE CONTEST:

• This contest was conducted by codeforces #874 for Div 3 Participants.
• In this Contest, there are 7 problems, and 2 hours and 15 minutes are given to solve this problem.
• For each wrong 10 minutes extra penalty problems.

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

My Experience:

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

OVERVIEW OF ALL CONTEST PROBLEM:

Problem Name	Difficulty	Approx time to solve	Number of submissions by me
Musical Puzzle	Easy-Medium	8 – 10 minutes	1
Restore the Weather	Easy-Medium	10 – 15 minutes	1
Vlad Building Beautiful Array	Easy-Medium	10 – 15 minutes	2
Flipper	Easy-Medium	20 – 25 minutes	2
Round Dance	Easy-Medium	20 – 25 minutes	2
Ira and Flamenco	Hard	–	–
Ksyusha and Chinchilla	Hard	–	–

LET’S DISCUSS THE QUESTIONS:

Problem A – Musical Puzzle

For this question reads input and calculates the number of unique pairs formed by adjacent elements in the input lines, printing the count of these unique pairs.

Problem B – Restore the Weather

To solve this first reads an integer t. For each t test cases: Reads a sequence of integers. Creates pairs consisting of elements and their corresponding indices in the initial sequence. Sorts these pairs based on the elements. Repeats the process, sorting pairs based on the new indices obtained from the previous sort. Prints the sorted sequence of elements at each iteration.

Problem C – Vlad Building Beautiful Array

To solve this code takes every second line of input starting from the third line. It converts each line into a list of integers. Then, it checks whether any element in the list is odd, and if the minimum value is not -1. If these conditions are met, it prints ‘YES’. else it prints ‘NO’.

Problem D – Flipper

To solve these for each case: It reads an integer n and a sequence of integers a. If n is 1, it prints the sequence and moves to the next case. It rearranges the sequence a based on certain conditions involving the value of n. The rearranged sequence is printed as the output for each case.

Problem E – Round Dance

To solve this for each test case: Read the number of people at the holiday, n. Read the remembered neighbors for each person. Determine the minimum and maximum number of round dances by identifying cycles among the remembered neighbors. Output the minimum and maximum number of round dances for each test case.

Conclusion:

At the end I was able to solve A , B ,C ,D,E problem. For me problem F and G was difficult. All the best for upcoming contest.
Thank You !!!