Programming contests

DEIK Regionális Programozó Csapatverseny, egyetemi/főiskolai kategória, 2015. november 29.

November 29, 2015 10:40 AM – November 29, 2015 3:40 PM

Copying Books

Before the invention of book printing, it was very hard to make a copy of a book. All the contents had to be rewritten by hand by so-called scribers. The scriber had been given a book, and after several months, he finished its copy. One of the most famous scribers lived in the 15th century, and his name was Xaverius Endricus Remius Ontius Xendrianus (Xerox). Anyway, the work was very annoying and boring. And the only way to speed it up was to hire more scribers.

Once upon a time, there was a theater ensemble that wanted to play famous Antique Tragedies. The scripts of these plays were divided into many books, and actors needed more copies of them, of course. So they hired many scribers to make copies of these books. Imagine you have m books (numbered 1, 2, …, m) that may have different number of pages (p1p2, …, pm), and you want to make one copy of each of them. Your task is to divide these books among k scribers, k ≤ m. Each book can be assigned to a single scriber only, and every scriber must get a continuous sequence of books. That means there exists an increasing succession of numbers 0 = b0 < b1 < b2 < … < bk – 1 < bk = m such that the i-th scriber gets a sequence of books with numbers between bi – 1 + 1 and bi. The time needed to make a copy of all the books is determined by the scriber who was assigned the most work. Therefore, our goal is to minimize the maximum number of pages assigned to a single scriber. Your task is to find the optimal assignment.

Input Specification

The input consists of N test cases. The first line of the input contains only the positive integer N. Then follow the cases. Each test case consists of exactly two lines. On the first line, there are two integers m and k, 1 ≤ k ≤ m ≤ 500. On the second line, there are the integers p1p2, …, pm, separated by spaces. All these values are positive and less than 10 000 000.

Output Specification

For each test case, print exactly one line. The line must contain the input succession p1p2, …, pm divided into exactly k parts such that the maximum sum of a single part should be as small as possible. Use the slash character (“/”) to separate the parts. There must be exactly one space character between any two successive numbers and between a number and the slash.

If there is more than one solution, print the one that minimizes the work assigned to the first scriber, then to the second scriber, etc. But each scriber must be assigned at least one book.

Sample Input

  1. 2
  2. 9 3
  3. 100 200 300 400 500 600 700 800 900
  4. 5 4
  5. 100 100 100 100 100
download as text file

Output for Sample Input

  1. 100 200 300 400 500 / 600 700 / 800 900
  2. 100 / 100 / 100 / 100 100
download as text file
University of Debrecen; Faculty of Informatics; v. 03/01/2019