[PKU1112]TeamThemUp!巧妙构图动态规划.docVIP

[PKU 1112]Team Them Up! Team Them Up! Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2007 Accepted: 516 Special Judge Description Your task is to divide a number of persons into two teams, in such a way, that: everyone belongs to one of the teams; every team has at least one member; every person in the team knows every other person in his team; teams are as close in their sizes as possible. This task may have many solutions. You are to find and output any solution, or to report that the solution does not exist. Input For simplicity, all persons are assigned a unique integer identifier from 1 to N. The first line in the input file contains a single integer number N (2 = N = 100) - the total number of persons to divide into teams, followed by N lines - one line per person in ascending order of their identifiers. Each line contains the list of distinct numbers Aij (1 = Aij = N, Aij != i) separated by spaces. The list represents identifiers of persons that ith person knows. The list is terminated by 0. Output If the solution to the problem does not exist, then write a single message No solution (without quotes) to the output file. Otherwise write a solution on two lines. On the first line of the output file write the number of persons in the first team, followed by the identifiers of persons in the first team, placing one space before each identifier. On the second line describe the second team in the same way. You may write teams and identifiers of persons in a team in any order. Sample Input 5 2 3 5 0 1 4 5 3 0 1 2 5 0 1 2 3 0 4 3 2 1 0 Sample Output 3 1 3 5 2 2 4 Source Northeastern Europe 2001 题目大意：把n个人分成2各组，每一个人有他所认识的人。所分的组有四点要求： 1、?每个人都必需属于一个组。 2、?每个组至少有一个人。 3、?每个组里面的每个人必需互相认识。 4、?两个组的成员应尽量接近。 首先分析这道题目，题目给出的是一个有向图，即如果有A认识B，但不一定有B认识A。但是在所分配的组里面，任意两个人都要互相认识。 1、?先读入数据建立有向图，然后对这个有向图进行处理，如果两个点之间的边是单向边，就认为两个点之间无边（因为这两个人不互相认识），对于两个点间的双向边，即建立一条无向边（这两个人互相认识），这样就可以把一个有向图转化为一个无向图。 2、?将这个无向图转化为它的反图。即有边的把边删去，无边的添上一条边。（其实1，2步在程序实现时可以一次完成）。 3、?对转换后的反图求极大连通