[Home|Training|Problems|Contests|C Language] | [Login|Register] |

Problems Status Rank |
Problem 1009
You Who?
Time Limit: 1000ms
Memory Limit: 65536kb Description
On the first day of first grade at Friendly Elementrary School, it is customary
for each student to spend one minute talking to every classmate that he
or she does not already know. When student Bob sees an unfamilar
face, he says ``You who?'' A typical response is ``Me Charlie, you
who?'' Then Bob says, ``Me Bob!'' and they talk for a minute.
It's very cute. Then, after a minute, they part and each looks for
another stranger to greet. This takes time. In class of twenty-nine
or thirty mutual strangers, it takes 29 minutes; time that, according to
teachers, could be better spent learning the alphabet. Of course,
it is rare to have a first grade class where nobody knows anyone else;
there are neighbors and playmates who already know each other, so they
don't have to go through the get-to-know-you minutes with each other.The two first grade teachers have requested that, to save time, students be allocated to their two classes so that the difference in the sizes of the classes is at most one, and the time it takes to complete these introductions is as small as possible. There are no more than 60 students in the incoming first grade class. How can the assignment of students to classes be made? Your job is to write the software that answers the question. Input
The school records include information about these student friendships,
represented as lists of numbers. If there are 29 students, then they
are represented by the numbers 1 to 29. The record for a single student
includes, first, his/her student identification number (1 to 29, in this
example), then the number of his/her acquaintances, then a list of them
in no particular order. So, for example, this record17 4 5 2 14 22indicates that student 17 knows 4 students: 5, 2, and so on. The records for all the students in the incoming class are represented as the list of numbers that results from concatenating all the student records together. Spaces and line breaks are irrelevent in this format. Thus, this 1 1 2 2 1 1is a whole database, indicating that there are only two students in the incoming class, and they know each other; and this 1 2 3 4 2 2 3 4 3 2 1 2 4 2 1 2indicates that 1 doesn't know 2, and 3 doesn't know 4, but all other pairs know each other. The database has been checked for consistency, so that if A knows B, then B knows A. Output
Your output should begin with a number that tells how long it will take
to complete the introductions in the best possible legal class assignment.
Subsequent output consists of a list of class enrollments that achieves
that bound. An enrollment is represented by the number of students
in the class, and then a list of the students in the class, in increasing
order. The complete solution, then, is the number that reports the
introduction time, then the list of enrollments. There are no particular
rules on output format; a list of numbers in any readable format is fine.So, for the simple two student problem above, the only legal answer is 1 2 1 2 Sample Input
1 2 3 4 2 2 3 4 3 2 1 2 4 2 1 2 Sample Output
1 4 1 2 3 4 |

University of Science and Technology of China

Online Judge for ACM/ICPC

Processed in 0.9ms with 1 query(s).

Online Judge for ACM/ICPC

Processed in 0.9ms with 1 query(s).