PAT-BASIC1072——開學寄語

我的PAT-BASIC代碼倉：https://github.com/617076674/PAT-BASIC

原題連結：https://pintia.cn/problem-sets/994805260223102976/problems/994805263964422144

題目描述：

知識點：标記數組

思路：用一大小為10000的數組标記需要被查繳的物品

時間複雜度是O(n)，其中n為需要檢查的學生總物品數。空間複雜度是O(10000)。

C++代碼：

#include<iostream>
#include<string>

using namespace std;

int main(){
	int N, M;
	cin >> N >> M;
	
	int illegals[10000];
	for(int i = 0; i < 10000; i++){
		illegals[i] = 0;
	}
	
	int tempIllegal;
	for(int i = 0; i < M; i++){
		scanf("%d", &tempIllegal);
		illegals[tempIllegal] = 1;
	}
	
	string name;
	int count;
	int things;
	int countStudent = 0;
	int countThing = 0;
	for(int i = 0; i < N; i++){
		cin >> name >> count;
		bool isFirstIllegal = true;
		for(int i = 0; i < count; i++){
			scanf("%d", &things);
			if(illegals[things] == 1){
				if(isFirstIllegal){
					isFirstIllegal = false;
					cout << name << ":";
				}
				printf(" %04d", things);
				countThing++;
			}
		}
		if(!isFirstIllegal){
			countStudent++;
			printf("\n");
		}
	}
	printf("%d %d", countStudent, countThing);
	
	return 0;
}
           

C++解題報告：