不知道有什么问题，麻烦大佬帮忙看看

#include <iostream>
#include <unordered_set>
using namespace std;
unordered_set<int> standard[1001];

int main() {
	int n, m, point, grade = 0, l;
	scanf("%d%d", &n, &m);

	for (int i = 1; i <= n; i++)

		for (int j = 1; j <= m; j++) {

			scanf("%d", &point);
			standard[i].insert(point);
		}

	for (int i = 1; i <= n; i++) {

		scanf("%d", &l);

		for (int j = 1; j <= l; j++) {

			scanf("%d", &point);

			if (standard[i].find(point) != standard[i].end())
				standard[i].erase(standard[i].find(point));

			if (standard[i].empty() == true) {
				grade += 2;
				break;
			}
		}
	}

	printf("%d", grade);
	return 0;
}