No tags yet

No tag edit access

The problem statement has recently been changed. View the changes.

×
104. Little shop of flowers time limit per test: 0.25 sec.
PROBLEM You want to arrange the window of your flower shop in a most pleasant way. You have
Each vase has a distinct characteristic (just like flowers do). Hence, putting a bunch of flowers in a vase results in a certain aesthetic value, expressed by an integer. The aesthetic values are presented in a table as shown below. Leaving a vase empty has an aesthetic value of 0.
According to the table, azaleas, for example, would look great in vase 2, but they would look awful in vase 4.
To achieve the most pleasant effect you have to maximize the sum of aesthetic values for the arrangement while keeping the required ordering of the flowers. If more than one arrangement has the maximal sum value, any one of them will be acceptable. You have to produce exactly one arrangement.
ASSUMPTIONS - 1 ≤
*F*≤ 100 where*F*is the number of the bunches of flowers. The bunches are numbered 1 through*F*. - F ≤
- -50 £
*A*£ 50 where_{ij}*A*_{ij }_{is the aesthetic value obtained by putting the flower bunch i into the vase j. }
V ≤ 100 where V is the number of vases.
Input
- The first line contains two numbers:
*F*,*V*. - The following
*F*lines: Each of these lines contains*V*integers, so that*A*_{ij}_{ is given as the j’th number on the (i+1)’st line of the input file. }
Output
- The first line will contain the sum of aesthetic values for your arrangement.
- The second line must present the arrangement as a list of
*F*numbers, so that the*k*’th number on this line identifies the vase in which the bunch*k*is put.
Sample Input 3 5 7 23 -5 -24 16 5 21 -4 10 23 -21 5 -4 -20 20
Sample Output 53 2 4 5 |

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/06/2021 21:31:15 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|