【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 = ;
 int T, n, m, tot, b[maxn], r[maxn], a[maxn][maxn], link[maxn], ans;
 bool vis[maxn];
 inline int read()
 {
     int ret=;
     char c=getchar();
     while (c<'' || c>'') c=getchar();
     while (c>='' && c<=''){
         ret=((ret<<)+(ret<<))+c-'';
         c=getchar();
     }
     return ret;
 }
 int gcd(int x, int y)
 {
     if(x%y == ) return y;
     else return gcd(y,x%y);
 }
 
 bool dfs(int x)
 {
     fo(i,n)
     {
         if(a[x][i] ==  && !vis[i])
         {
             vis[i] = ;
             if(!link[i] || dfs(link[i]))
             {
                 link[i] = x;
                 return ;
             }
         }
     }
     return ;
 }
 int main()
 {
     scanf("%d",&T);
     fo(ii,T)
     {
         memset(b,,sizeof(b));
         memset(r,,sizeof(r));
         memset(a,,sizeof(a));
         memset(link,,sizeof(link));
         ans = ;
         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]) > )
             {
                 a[i][j] = ;
             }
         }
 
         fo(i,m)
         {
             memset(vis,,sizeof(vis));
             if(dfs(i)) ans++;
         }
         printf("%d\n",ans);
     }
     return ;
 }