LightOJ1356 Prime Independence(数论+匹配)

LightOJ1356

题目

给出n个数, 现在要选出一个”素数独立集合”, 如果一个数是另外一个数的素数倍, 这两个不能同时选入,问这个集合的最大大小是多少?

思路

http://tokers.cn/2015/07/11/lightoj1356-prime-independence%E6%95%B0%E8%AE%BA%E5%8C%B9%E9%85%8D/
知道了Hopcroft-Karp算法，用二分图来处理。

代码

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;

const int maxn=500000+10;

int prime[maxn];
int tot,head[maxn],arr[maxn],vis[maxn];


struct node
{
    int next;
    int to;
} edge[maxn];

void addedge(int from,int to)
{
    edge[tot].to=to;
    edge[tot].next=head[from];
    head[from]=tot++;
}

void getprime()
{
    int n=500000;
    for(int i=2; i<=n; i++)
    {
        prime[i]=1;
    }
    prime[1]=0;
    for(int i=2; i<=n; i++)
    {
        if(prime[i])
        {
            if(n/i<i)
                break;
            for(int j=i*i; j<=n; j+=i)
            {
                prime[j]=0;
            }
        }
    }
}

const int MAXN = 40010;
const int inf=0x3f3f3f3f;
int Mx[MAXN], My[MAXN];
int dx[MAXN], dy[MAXN];
int dis;
int uN;
bool used[MAXN];

bool SearchP()
{
    queue <int> Q;
    dis = inf;
    memset(dx, -1, sizeof(dx));
    memset(dy, -1, sizeof(dy));
    for (int i = 1; i <= uN; ++i)
    {
        if (Mx[i] == -1)
        {
            Q.push(i);
            dx[i] = 0;
        }
    }
    while (!Q.empty())
    {
        int u = Q.front();
        Q.pop();
        if (dx[u] > dis)
        {
            break;
        }
        for (int i = head[u]; ~i; i = edge[i].next)
        {
            int v = edge[i].to;
            if (dy[v] == -1)
            {
                dy[v] = dx[u] + 1;
                if (My[v] == -1)
                {
                    dis = dy[v];
                }
                else
                {
                    dx[My[v]] = dy[v] + 1;
                    Q.push(My[v]);
                }
            }
        }
    }
    return dis != inf;
}

bool dfs(int u)
{
    for (int i = head[u]; ~i; i = edge[i].next)
    {
        int v = edge[i].to;
        if (!used[v] && dy[v] == dx[u] + 1)
        {
            used[v] = 1;
            if (My[v] != -1 && dy[v] == dis)
            {
                continue;
            }
            if (My[v] == -1 || dfs(My[v]))
            {
                My[v] = u;
                Mx[u] = v;
                return 1;
            }
        }
    }
    return 0;
}

int MaxMatch()
{
    int res = 0;
    memset(Mx, -1, sizeof(Mx));
    memset(My, -1, sizeof(My));
    while (SearchP())
    {
        memset(used, 0, sizeof(used));
        for (int i = 1; i <= uN; ++i)
        {
            if (Mx[i] == -1 && dfs(i))
            {
                ++res;
            }
        }
    }
    return res;
}

int main()
{
    getprime();
    int kase=1;
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        memset(vis,0,sizeof(vis));
        memset(head,-1,sizeof(head));
        tot=0;
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&arr[i]);
            vis[arr[i]]=i;
        }
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j*j<=arr[i]; j++)
            {
                if(arr[i]%j==0)
                {
                    if(prime[arr[i]/j]&&vis[j])
                    {
                        addedge(vis[j],i);
                        addedge(i,vis[j]);
                    }

                    if(arr[i]/j!=j&&vis[arr[i]/j]&&prime[j])
                    {
                        addedge(i,vis[arr[i]/j]);
                        addedge(vis[arr[i]/j],i);
                    }
                }
            }
        }
        uN=n;
        printf("Case %d: %d\n",kase++,uN-MaxMatch()/2);
    }

    return 0;
}