pypy3 解法, 执行用时: 2895ms, 内存消耗: 57712K, 提交时间: 2022-05-10 21:18:35

for cas in range(int(input())):
    n, m = map(int, input().split())
    c = []
    for i in range(n):
        c.append(list(map(int, input().split())))
    a = [i for i in range(n)]
    for tmp in input().split():
        b = int(tmp)
        nxt = []
        for x in a:
            for y in c[x]:
                if y == b:
                    nxt.append(x)
                    break
        print(len(nxt), end = ' ')
        a = nxt
    print('')

C++ 解法, 执行用时: 507ms, 内存消耗: 684K, 提交时间: 2022-05-06 20:17:22

#include<bits/stdc++.h>
using namespace std;
int main(){
	int t,n,m,i,j,v[205][205],x,s;
	scanf("%d",&t);
	while(t--){
		memset(v,0,sizeof v);
		scanf("%d%d",&n,&m);
		for(i=1;i<=n;i++){
			for(j=1;j<=m;j++){
				scanf("%d",&x);
				v[i][x]=1;
			}
		}
		for(i=1;i<=m;i++){
			s=0;
			scanf("%d",&x);
			for(j=1;j<=n;j++){
				if(!v[j][0]){
					if(v[j][x]) s++;
					else v[j][0]=1;
				}
			}
			printf("%d ",s);
		}
		printf("\n");
	}
	return 0; 
}

Python3 解法, 执行用时: 2854ms, 内存消耗: 5440K, 提交时间: 2022-05-19 10:14:33

T=int(input())
for _ in range(T):
    n,m=map(int,input().split(' '))
    arr=[1]*n
    brr=[[0]*205 for _ in range(n)]
    for i in range(n):
        for ci in map(int,input().split(' ')):
            brr[i][ci]=1
    cnt=0
    for cj in map(int,input().split(' ')):
        for i in range(n):
            if brr[i][cj]==0:
                arr[i]=0
        cnt+=1
        print(sum(arr),end=' ')
    print()