 |
Registrations for TCS CodeVita Season 11 have
started. Register today.
Get ready to unlock the world of programming
excitement with CodeVita! It's more than just a contest; it's a vibrant culture
that brings people from diverse backgrounds and cultures together, shattering
physical and cultural boundaries. At TCS, we believe that programming is a
thrilling adventure, and that's why we created CodeVita!
Fast forward to Season 10, and we witnessed a
jaw-dropping 3,05,000+ registrations from 87 countries, representing over 3500
institutes. Imagine participants from 10 regions engaging in a thrilling battle
during the grand finale! Are you intrigued? Brace yourself for more
exhilarating programming challenges and unforgettable experiences with
CodeVita!
Eligibility:
·
With year of completion 2024, 2025, 2026, and
2027.
·
From institutes across the globe.
·
Pursuing undergraduate/diploma/postgraduate
disciplines from engineering/science background with any specialization.
What's in it for students?
1. Top 3 coders to win total prize
money of USD 20,000/-
2. Chance to explore exciting
careers* with one of the world's most powerful brands
3. Chance to compete with some of the
best coders in the world
4. Platform to showcase your
programming skills
5. Finalists stand a chance to
travel** to India for the season 11 live grand finale experience.
Registration
The first step in your CodeVita journey. Click on the
register button to get started. more details from official TCS portal. Click Here for Register.
MockVitas
MockVitas are just like actual rounds to give you a
demo of the actual contest.
Rounds
Clear the Actual Rounds to move further in your
CodeVita journey.
Finale
Win prize money and prove that you are the best
coder.
Program -1:
The parcel section of the Head Post Office is in a
mess. The parcels that need to be loaded to the vans have been lined
up in a row in an arbitrary order of weights. The Head Post Master
wants them to be sorted in the increasing order of the weights of the parcels,
with one exception. He wants the heaviest (and presumably the most
valuable) parcel kept nearest his office.
More: Problem Description
It is the sports event of the year for the
residents of Sportsville. Their team had finally made it to the
finals of the Bowls League Cup.
They have booked tickets for the city contingent
for the same row, and the size of the contingent (N) is smaller than the number
of seats booked(S).Unfortunately, there was rain the previous night and some of
the seats are still wet. Some of the contingent love Bowls so much and are
excited enough not to mind sitting on a wet chair. There are k of these.
However, others want to sit on a dry seat so that they can enjoy the match
more.
The contingent wants to minimize the distance
between the first and last person in the row so that they can still conduct
Mexican Waves, and other forms of support for their team.
Because they want to sit together, any block of
15 or more contiguous unoccupied seats between the first person sitting and the
last person sitting is unacceptable.
There are M blocks of seats, starting with a dry
block, with alternating wet and dry blocks. The number of seats in
each block is known.
Given S (the number of seats in the row), N (the
size of the contingent),k (the number of the contingent who are willing to sit
in a wet seat), and the distribution of wet and dry blocks, write a program to
find the minimum distance between the first and the last member of the contingent
in the row.
Input
The first line contains four comma separated
numbers representing S, N, k and M respectively.
The second line is a set of M comma separated
numbers representing the number of seats in each block of seats. The
first block is dry, and the remaining blocks alternate between wet and dry.
Output
One integer representing the minimum distance
between the first and last member of the row. If it is impossible to
seat all the members according to their preferences,and with the unoccupied seat
restriction, the result should be 0.
Constraints
S,N,k < 1000, M < 30
Difficulty Level
Complex
Time Limit (secs)
1
Examples
Example 1
Input
100,50,5,6
3,10,30,5,30,22
Output
49
Explanation
S = 100, and there are 100 seats in the
row. N=50, and there are 50 members in the contingent. k=5, and 5
people (out of the 50) do not mind sitting on wet seats. M=6, and
there are 6 blocks of seats. The number of seats in each block is
3,10,30,5,30 and 22, with the first block of 3 seats being dry, the next 10
being wet and so on.
One possible positioning to achieve the minimum
distance is to place the a set of 30 people in seats 14 to 43 (the dry block),
the 5 people who do not mind sitting on wet seats in the wet block 44 to 48,
and the remaining 15 people (of the 50) in the seats 49 to 63. There
is no unoccupied seat between the first person and the last person, and so this
is acceptable. The distance between the last
More Visit TCS Code vita portal.https://codevita.tcsapps.com/
____________________________________________________________________________
No comments:
Post a Comment