C 解法, 执行用时: 1ms, 内存消耗: 228KB, 提交时间: 2019-05-09

#include<stdio.h>
#include<malloc.h>
 
int main()
{
    short n=0;
    short m=0;
    scanf("%hd%hd",&n,&m);
    int len=n*m;
    char* nLikes=calloc(len,sizeof(char));
    char* mLikes=calloc(len,sizeof(char));
 
    for(short i=0; i<n; i++)
    {
        short likeCount;
        scanf("%hd",&likeCount);
        for(short j=0; j<likeCount; j++)
        {
            short mNo;
            scanf("%hd",&mNo);
            nLikes[i*m+mNo-1]=1;
            mLikes[(mNo-1)*n+i]=1;
        }
    }
    for(short i=0; i<m; i++)
    {
        short likeCount;
        scanf("%hd",&likeCount);
        for(short j=0; j<likeCount; j++)
        {
            short nNo;
            scanf("%hd",&nNo);
            mLikes[i*n+nNo-1]=1;
            nLikes[(nNo-1)*m+i]=1;
        }
    }
 
    short danceCount=0;
    for(short i=0; i<n; i++)
    {
        short count=0;
        for(short j=0; j<m; j++)
        {
            if(nLikes[i*m+j])
            {
                count++;
            }
        }
        if(count>danceCount)
        {
            danceCount=count;
        }
    }
    for(short i=0; i<m; i++)
    {
        short count=0;
        for(short j=0; j<n; j++)
        {
            if(mLikes[i*n+j])
            {
                count++;
            }
        }
        if(count>danceCount)
        {
            danceCount=count;
        }
    }
    printf("%hd\n",danceCount);
 
    free(nLikes);
    free(mLikes);
    return 0;
}

C 解法, 执行用时: 1ms, 内存消耗: 232KB, 提交时间: 2019-11-06

#include<stdio.h>
#include<malloc.h>
  
int main()
{
    short n=0;
    short m=0;
    scanf("%hd%hd",&n,&m);
    int lenth=n*m;
    
    char* mLove=calloc(lenth,sizeof(char));
    char* wLove=calloc(lenth,sizeof(char));
  
    for(short i=0; i<n; i++)
    {
        short loveCount;
        scanf("%hd",&loveCount);
        for(short j=0; j<loveCount; j++)
        {
            short mNo;
            scanf("%hd",&mNo);
            mLove[i*m+mNo-1]=1;
            wLove[(mNo-1)*n+i]=1;
        }
    }
    for(short i=0; i<m; i++)
    {
        short loveCount;
        scanf("%hd",&loveCount);
        for(short j=0; j<loveCount; j++)
        {
            short nNo;
            scanf("%hd",&nNo);
            wLove[i*n+nNo-1]=1;
            mLove[(nNo-1)*m+i]=1;
        }
    }
  
    short danceCount=0;
    for(short i=0; i<n; i++)
    {
        short count=0;
        for(short j=0; j<m; j++)
        {
            if(mLove[i*m+j])
            {
                count++;
            }
        }
        if(count>danceCount)
        {
            danceCount=count;
        }
    }
    for(short i=0; i<m; i++)
    {
        short count=0;
        for(short j=0; j<n; j++)
        {
            if(wLove[i*n+j])
            {
                count++;
            }
        }
        if(count>danceCount)
        {
            danceCount=count;
        }
    }
    printf("%hd\n",danceCount);
  
    free(mLove);
    free(wLove);
    return 0;
}