牛客多校第五场 F （最大点独立集）

二分图最大点独立集 （补集为最小点覆盖）

网络流做法，执行完最大流后，与S连通的左部点和不与S连通的右部点为最大点独立集。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef int lint;
const lint maxn = 5000 + 100;
const lint maxm = 50000000 + 100;
const int inf = 0x3f3f3f3f;
lint lowbit( lint x ){
    return x & -x;
}
bool judge(int a, int b) {
    a ^= b;
    a ^= lowbit(a);
    return a != 0;
}
lint a[maxn];
lint color[maxn], v[maxn];
int vis[maxn],cnt,n;
struct dinic{
    static const int N = 1000005;
    static const int M = 20000005;
    static const lint inf = 0x3f3f3f3f;
    int he[N],ne[M],ver[M],d[N];
    lint edge[M];
    int s,t,tot;
    queue<int> que;
    void init( int n ){
        for( int i = 0;i <= n;i++ ){
            he[i] = 0;
        }
        tot = 1;
    }
    void add( int x,int y,lint z ){
        ver[++tot] = y; ne[ tot ] = he[x]; he[x] = tot; edge[ tot ] = z;
        ver[++tot] = x; ne[tot] = he[y]; he[y] = tot;edge[tot] = 0;
    }
    bool bfs(){
        memset( d,0,sizeof( d ) );
        while( que.size() ) que.pop();
        que.push( s );
        d[s] = 1;
        while( que.size() ){
            int x = que.front();
            que.pop();
            for( int cure = he[x];cure;cure = ne[cure] ){
                int y = ver[cure];
                if( edge[cure] && !d[y] ){
                    que.push( y );
                    d[ y ] = d[x] + 1;
                    if( y == t ) return 1;
                }
            }
        }
        return 0;
    }
    lint dfs( int x,lint flow ){
        if( x== t ) return flow;
        lint rest = flow,k;
        for( int cure = he[x];cure && rest;cure = ne[cure] ){
            int y = ver[cure];
            if( edge[cure] && d[ y ] == d[x] + 1 ){
                k = dfs( y,min( rest,edge[cure] ) );
                if( !k ) d[ y ] = 0;
                edge[cure] -= k;
                edge[ cure^1 ] += k;
                rest -= k;
            }
        }
        return flow - rest;
    }
    lint max_flow( int x,int y ){
        s = x; t = y;
        lint maxflow = 0;
        lint flow = 0;
        while( bfs() )
            while( flow = dfs( s,inf ) ) maxflow += flow;
        return maxflow;
    }
    void solve(int S,vector<int>& ans){
        memset( vis,0,sizeof(vis) );
        que.push(S);
        vis[S] = 1;
        while(que.size()){
            int x = que.front();
            que.pop();
            for( int cure = he[x];cure;cure = ne[cure] ){
                if( !edge[cure]  ) continue;
                int y = ver[cure];
                if( vis[y] ) continue;
                que.push( y );
                vis[y] = 1;
            }
        }
        for( int i = 1;i <=n;i++ ){
            if( vis[i] && color[i] ) ans.push_back(i);
            else if( !vis[i] && !color[i] ) ans.push_back(i);
        }
    }
} g;
int tot,he[maxn],ver[maxm],ne[maxm];
void add( int x,int y ){
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
}
void dfs(lint x, lint c) {
    v[x] = 1;if( c==1 )cnt++;
    color[x] = c;
    for (lint cure = he[x]; cure; cure = ne[cure]) {
        lint y = ver[cure];
        if (v[y]) continue;
        dfs(y, c ^ 1);
    }
}
vector<lint> ans;
int main(){
    scanf("%d",&n);
    int S = 0,T = 2*n+1;
    for( int i = 1;i <= n;i++ ){
        scanf("%d",&a[i]);
    }
    g.init(T);
    for( int i = 1;i <= n;i++ ){
        for( int j = i+1;j <= n;j++ ){
            if( !judge( a[i],a[j] ) ){
                add( i,j);add(j,i);
            }
        }
    }
    for( lint i = 1;i <= n;i++ ){
        if(v[i]) continue;
        dfs(i,1);
    }
    for( lint i = 1;i <= n;i++ ){
        if( color[i] == 1 ){
            g.add(S,i,1 );
            for( int cure = he[i];cure;cure= ne[cure] ){
                int y = ver[cure];
                g.add( i,y,1 );
            }
        }else g.add( i,T,1 );
    }
    int maxflow = g.max_flow(S,T);
    g.solve(S,ans);
    printf("%d\n",n-maxflow);
    printf("%d",a[ans[0]]);
    for( lint i = 1;i < ans.size();i++ ){
        printf(" %d",a[ans[i]]);
    }
    return 0;
}