Team Them Up! POJ - 1112

若两个人两两不认识这两两两一条边，判断是否能够染色。会将其分为多个可以染色的子图，再dp背包使人数尽可能少

#include<iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define fst first
#define sec second
#define sci(num) scanf("%d",&num)
#define scl(num) scanf("%lld",&num)
#define mem(a,b) memset(a,b,sizeof a)
#define cpy(a,b) memcopy(a,b,sizeof b)
typedef long long LL;
typedef pair<int,int> P;
const int MAX_N = 110;
int N;
int head[MAX_N],len;
int cols[MAX_N];
bool G[MAX_N][MAX_N];
struct edge {
    int to,next;
} es[MAX_N * MAX_N];
int DP[MAX_N][MAX_N<<1];
int ans[MAX_N][MAX_N<<1];
void addedge(int from,int to) {
    es[len].to = to; es[len].next = head[from];
    head[from] = len++;
}
vector<int> LN[MAX_N][2];
int num;
void init() {
    mem(head,-1); len = 0;
    mem(G,0);
    mem(cols,-1);
    for (int i = 0;i <= N;i++) {
        LN[i][0].clear();
        LN[i][1].clear();
    }

}
bool color(int u,int flag) {
    cols[u] = flag;
    LN[num][flag].push_back(u);
    for (int i = head[u]; ~i ;i = es[i].next) {
        edge& e = es[i];
        if (cols[e.to] == cols[u]) {
            return false;
        }
        if (cols[e.to] != -1) continue;
        if (!color(es[i].to,!flag)) return false;
    }
    return true;
}
vector<int> team[2];
int main() {
    init();
    sci(N);
    for (int i = 1;i <= N;i++) {
        int u;
        while (sci(u),u) {
            G[i][u] = 1;
        }
    }
    for (int i = 1;i <= N;i++) {
        for (int j= i + 1;j <= N;j++) {
            if (!(G[i][j] && G[j][i])) {
                addedge(i,j);
                addedge(j,i);
            }
        }
    }
    bool flag = true;
    for (int i = 1;i <= N && flag;i++) {
        if (cols[i] == -1) {
            num++;
            if (!color(i,0))  flag = false;
        }
    }
    if (!flag) {
        printf("No solution\n");
        return 0;
    }
    mem(DP,false); mem(ans,-1);
    DP[0][100] = true;
    for (int i = 1;i <= N;i++) {
        int d1 = LN[i][0].size() - LN[i][1].size();
        int d2 = -d1;
        for (int v = 0;v <= 200;v++) {
            if (DP[i - 1][v]) {
                DP[i][v +d1] = true;
                DP[i][v  + d2] = true;
                ans[i][v +d1] = 0;
                ans[i][v +d2] = 1;
            }
        }
    }
    int del = 0;
    for (int v= 100;v + del <= 200;del++) {
        if (DP[N][v +del] || DP[N][v - del])
            break;
    }
    for (int v = 100 + del,i = N;i >= 1;i--) {
        if (ans[i][v]) {
            v = v - LN[i][1].size() + LN[i][0].size();
            for (int j = 0;j < LN[i][1].size();j++) {
                team[0].push_back(LN[i][1][j]);
            }
            for (int j = 0;j < LN[i][0].size();j++) {
                team[1].push_back(LN[i][0][j]);
            }
        } else {
            v = v - LN[i][0].size() + LN[i][1].size();
            for (int j = 0;j < LN[i][1].size();j++) {
                team[1].push_back(LN[i][1][j]);
            }
            for (int j = 0;j < LN[i][0].size();j++) {
                team[0].push_back(LN[i][0][j]);
            }
        }
    }
    int f2;
    if (team[1][0] == 1) f2 = 1;
    else f2 = 0;
    sort(team[0].begin(),team[0].end());
    sort(team[1].begin(),team[1].end());
    printf("%d",team[f2].size());
    for (int i = 0;i < team[f2].size();i++){
        printf(" %d",team[f2][i]);
    }
    printf("\n");
    printf("%d",team[!f2].size());
    for (int i = 0;i < team[!f2].size();i++){
        printf(" %d",team[!f2][i]);
    }
    printf("\n");
    return 0;
}