【luogu P2065 [TJOI2011]卡片】 假题解

题目链接：https://www.luogu.org/problemnew/show/P2065

辣鸡匈牙利，没有优化贼鸡儿慢

// luogu-judger-enable-o2
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define ri register
#define fo(a,b) for(ri int a = 1; a <= b; a++)
using namespace std;
const int maxn = 2000;
int T, n, m, tot, b[maxn], r[maxn], a[maxn][maxn], link[maxn], ans;
bool vis[maxn];
inline int read()
{
    int ret=0;
    char c=getchar();
    while (c<'0' || c>'9') c=getchar();
    while (c>='0' && c<='9'){
        ret=((ret<<3)+(ret<<1))+c-'0';
        c=getchar();
    }
    return ret;
}
int gcd(int x, int y)
{
    if(x%y == 0) return y;
    else return gcd(y,x%y);
}

bool dfs(int x)
{
    fo(i,n)
    {
        if(a[x][i] == 1 && !vis[i])
        {
            vis[i] = 1;
            if(!link[i] || dfs(link[i]))
            {
                link[i] = x;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    scanf("%d",&T);
    fo(ii,T)
    {
        memset(b,0,sizeof(b));
        memset(r,0,sizeof(r));
        memset(a,0,sizeof(a));
        memset(link,0,sizeof(link));
        ans = 0;
        m = read();
        n = read();
        
        
        fo(i,m)
        b[i] = read();

        fo(i,n)
        r[i] = read();
        
        fo(i,m)
        fo(j,n)
        {
            if(gcd(b[i],r[j]) > 1)
            {
                a[i][j] = 1;
            }
        }
        
        fo(i,m)
        {
            memset(vis,0,sizeof(vis));
            if(dfs(i)) ans++;
        }
        printf("%d
",ans);
    }
    return 0;
}