题意
题解
建立原图的补图,即若两个人之间不相互认识,则连一条边;此时一条边的两个端点不能分在同一组中。那么判断是否存在可行的分组方案,染色法进行二分图判定即可。由于 N ≥ 2 N\geq 2 N≥2,则若补图是二分图,则满足每一组至少存在一个人。
记录补图连通分量 i i i 染色为 k k k 的节点数 s u m [ i ] [ k ] sum[i][k] sum[i][k]。设两个组为 A , B A,B A,B,则问题转化为求解从每一个连通分量中选取染为某个颜色的节点集合加入 A A A,可以取到的最逼近 N / 2 N/2 N/2 的值。 d p [ i ] [ j ] dp[i][j] dp[i][j] 代表从连通分量 [ 1 , i ] [1,i] [1,i] 中选取,是否可以使组 A A A 的节点数为 j j j d p [ i ] [ j ] = d p [ i − 1 ] [ j − s u m [ i ] [ 0 ] ] ∣ ∣ d p [ i − 1 ] [ j − s u m [ i ] [ 1 ] ] dp[i][j] = dp[i-1][j-sum[i][0]]\ ||\ dp[i-1][j-sum[i][1]] dp[i][j]=dp[i−1][j−sum[i][0]] ∣∣ dp[i−1][j−sum[i][1]] 记录状态转移,对每个连通分量 D F S DFS DFS 统计 A A A 选取的节点即可。
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 105, maxe = maxn * maxn;
int N, col[maxn], num, st[maxn], sum[maxn][2];
int tot, head[maxn], to[maxe], nxt[maxe];
int dp[maxn][maxn], pre[maxn][maxn];
bool G[maxn][maxn], vs[maxn];
vector<int> A, B;
inline void add(int x, int y) { to[++tot] = y, nxt[tot] = head[x], head[x] = tot; }
bool dfs(int x, int c, int &n0, int &n1)
{
col[x] = c, n0 += c == -1, n1 += c == 1;
for (int i = head[x]; i; i = nxt[i])
{
int y = to[i];
if (!col[y])
{
if (!dfs(y, -c, n0, n1))
return 0;
}
else if (col[y] == c)
return 0;
}
return 1;
}
void dfs2(int x, int c)
{
vs[x] = 1;
if (col[x] == c)
A.push_back(x);
else
B.push_back(x);
for (int i = head[x]; i; i = nxt[i])
{
int y = to[i];
if (!vs[y])
dfs2(y, c);
}
}
void out(vector<int> &a)
{
printf("%d", (int)a.size());
for (int i = 0; i < (int)a.size(); ++i)
printf(" %d", a[i]);
putchar('\n');
}
int main()
{
scanf("%d", &N);
for (int i = 1, j; i <= N; ++i)
while (~scanf("%d", &j) && j)
G[i][j] = 1;
for (int i = 1; i <= N; ++i)
for (int j = i + 1; j <= N; ++j)
if (!G[i][j] || !G[j][i])
add(i, j), add(j, i);
bool f = 1;
for (int i = 1; i <= N; ++i)
if (!col[i])
{
st[++num] = i;
if (!dfs(i, 1, sum[num][0], sum[num][1]))
{
f = 0;
break;
}
}
if (!f)
{
puts("No solution");
return 0;
}
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= num; ++i)
for (int j = 0; j <= N; ++j)
for (int k = 0; k < 2; ++k)
if (j - sum[i][k] >= 0 && dp[i - 1][j - sum[i][k]])
dp[i][j] = 1, pre[i][j] = k;
int p = -1, lim = N / 2;
for (int j = lim; j >= 0; --j)
if (dp[num][j])
{
p = j;
break;
}
for (int i = num; i; --i)
{
int k = pre[i][p];
dfs2(st[i], k ? 1 : -1);
p = p - sum[i][k];
}
out(A), out(B);
return 0;
}