PAT（甲级）2021年春季考试(模拟考）

这是我买的第一张试卷。。第一次50，第二次50。好不容易凑满了，泪目。花了我十块钱嘤嘤嘤。

7-1 Arithmetic Progression of Primes (20 分)

实不相瞒，一开始看这道题想半天没做出来时候，我不想考了。

#include<iostream>
#include<vector>
#include<unordered_set>
#include<cmath>
using namespace std;
int n, maxp;
vector<int> primes;
vector<int> flags;
//判断是否质数
bool judge_prime(int x){
	if(x==0 || x==1) return false;
	int t = sqrt(x);
	for(int i = 2; i <= t; i++){
		if(x%i==0) return false;
	}
	return true;
}

int main(){
	scanf("%d %d", &n, &maxp);
//将所有质数找出来	
	flags.resize(maxp+1, 0);
	for(int i = 1; i <= maxp; i++){
		if(judge_prime(i)) {
			primes.push_back(i);
			flags[i] = 1;
		}
	}
//只有一个或两个数的时候，数组非质数。这是卡的一个两分的测试点
    if(n==1 || n==2) {cout << primes[primes.size()-1] << endl; return 0;}
	//for(auto a:primes) cout << a << " "; cout << endl;

	vector<int> tmp;
	vector<int> ans;
	int maxI = -1;
//依次遍历每个质数，以该质数为起点找符合条件的公差
	for(int i = 0; i < primes.size(); i++){
		//这边一开始弄错了，测试点1一直过不去。公差tie的时候选起始点大的
		int t = (maxI==-1)?2:maxI;
		int x = primes[i];
		while(true){
			if(x+(n-1)*t > maxp) break;
			tmp.clear(); int k = x; tmp.push_back(x);
			for(int j = 1; j < n; j++){
				k = k+t;
				if(flags[k]==0) break;
				tmp.push_back(k);
			}
			if(tmp.size()==n) {
				ans = tmp;
				maxI = t;
			}
			t++;
		}
	}
	if(maxI==-1) {printf("%d\n", primes[primes.size()-1]); return 0;}
	bool first = true;
	for(auto a:ans){
		if(first) first = false; else printf(" ");
		printf("%d", a);
	}



}

7-2 Lab Access Scheduling (25 分)

贪心

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N;
vector<vector<int>> times;
int main(){
    cin >> N;
    for(int i = 0; i < N; i++){
        int h1, m1, s1, h2, m2, s2;
        scanf("%d:%d:%d", &h1, &m1, &s1);
        scanf("%d:%d:%d", &h2, &m2, &s2);
        vector<int> v = {h1*3600+m1*60+s1, h2*3600+m2*60+s2};
        times.push_back(v);
    }
    sort(times.begin(), times.end(), [](const vector<int>& l, const vector<int>& r){
        return l[0]<r[0] || (l[0]==r[0] && l[1]<r[1]);
    });
    int cnt = 0;
    int R = 0;
    for(int i = 0; i < N; i++){
        if(times[i][0]>=R) {
            cnt++;
            R = times[i][1];
        }
        else{
            if(times[i][1]<R) R = times[i][1];
        }
        
    }
    cout << cnt << endl;
    
}

7-3 Structure of Max-Heap (25 分)

#include<iostream>
#include<vector>
#include<unordered_map>
using namespace std;
int N, M;
vector<int> v;
int main(){
    cin >> N >> M;
    v.resize(N, 0);
    for(int i = 0; i < N; i++){
        int x; scanf("%d", &x);
        v[i] = x;
        if(i==0) continue;
        int t = i;
        while(t>0 && v[t] > v[(t-1)/2]) {swap(v[t], v[(t-1)/2]); t = (t-1)/2;}
    }
    //for(auto a:v) cout << a << " ";
    unordered_map<int, int> pos;
    for(int i = 0; i < N; i++) pos[v[i]] = i;
    int x, y;
    for(int i = 0; i < M; i++){
        scanf("%d", &x); string s; cin >> s;
        if(s=="and"){
            scanf("%d", &y);
            if(pos.count(x)==0 || pos.count(y)==0) {cout << 0; getline(cin, s); continue;}
            int p1 = pos[x], p2 = pos[y];
            if((p1-1)/2==(p2-1)/2) cout << 1;
            else cout << 0;
            getline(cin, s);
            continue;
        }
        cin >> s; cin >> s;
        if(s=="root"){
            if(pos.count(x)==0 || pos[x]!=0) cout << 0;
            else cout << 1;
            getline(cin, s);
        }
        else if(s=="parent"){
            cin >> s; scanf("%d", &y);
            if(pos.count(x)==0 || pos.count(y)==0) {cout << 0; getline(cin, s); continue;}
            int p1 = pos[x], p2 = pos[y];
            if((p2-1)/2==p1) cout << 1;
            else cout << 0;
            getline(cin , s);
        }
        else if(s=="left"){
            cin >> s; cin >> s; scanf("%d", &y);
            if(pos.count(x)==0 || pos.count(y)==0) {cout << 0; getline(cin, s); continue;}
            int p1 = pos[x], p2 = pos[y];
            if((p2*2+1)==p1) cout << 1;
            else cout << 0;
            getline(cin , s);            
        }
        else if(s=="right"){
            cin >> s; cin >> s; scanf("%d", &y);
            if(pos.count(x)==0 || pos.count(y)==0) {cout << 0; getline(cin, s); continue;}
            int p1 = pos[x], p2 = pos[y];
            if((p2*2+2)==p1) cout << 1;
            else cout << 0;
            getline(cin , s);               
        }
    }
    
}

7-4 Recycling of Shared Bicycles (30 分)

第一次做理解题意没弄懂就没做。用迪杰斯特拉算法求每个点到各点的最短距离，唉，这个算法我还是不熟练，而且这种题目有好多变种。

#include<iostream>
#include<vector>
using namespace std;
int n, m;
vector<vector<int>> dis;
int main(){
	scanf("%d %d", &n, &m);
	dis.resize(n+1, vector<int>(n+1, -1));
	for(int i = 0; i < m; i++){
		int s1, s2, d;
		scanf("%d %d %d", &s1, &s2, &d);
		dis[s1][s2] = d; dis[s2][s1] = d;
	}

	for(int i = 0; i <= n; i++){
        vector<int> visited(n+1, 0);
		for(int j = 0; j < n; j++){
			int D = 1e9; int id = -1;
			for(int t = 0; t <= n; t++){
				if(visited[t]==1 || dis[i][t]==-1) continue;
				if(dis[i][t]<D) {D = dis[i][t]; id = t;}
			}
			if(id==-1) break;
			visited[id] = 1;
			for(int t = 0; t <= n; t++){
				if(t==i || visited[t]==1 || dis[id][t]==-1) continue;
				if(dis[i][t]==-1) dis[i][t] = dis[i][id]+dis[id][t];
				else dis[i][t] = min(dis[i][t], dis[i][id]+dis[id][t]);
			}
		}
	}
/*
	for(int i = 0; i <= n; i++){
		for(int j = 0; j <= n; j++){
			printf("%d ", dis[i][j]);
		}
		printf("\n");
	}
*/
	vector<int> visited(n+1, 0);
	vector<int> ans;
	int root = 0; int Dis = 0;
	while(true){
		visited[root] = 1; ans.push_back(root);
		int D = 1e9, id = 500;
		for(int i = 0; i <= n; i++){
			if(visited[i] || dis[root][i]==-1) continue;
			if(dis[root][i]<D || (dis[root][i]==D && i < id)) {
				D = dis[root][i];
				id = i;
			}
		}
		if(id == 500) break;
		Dis += D;
		root = id;
	}
	bool first = true;
	for(auto a:ans){
		if(first) first = false; else printf(" ");
		printf("%d", a);
	}
	printf("\n");
	if(ans.size()==n+1) {printf("%d\n", Dis); return 0;}
	vector<int> Q;
	for(int i = 0; i <= n; i++)
		if(visited[i]==0) Q.push_back(i);

	first = true;
	for(auto a:Q){
		if(first) first = false; else printf(" ");
		printf("%d", a);
	}
	printf("\n");




}