2020 PAT 甲级秋季题解

第一题

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
const int N = 10010;
const int INF = 0x3f3f3f3f;
int n;
vector<int> milk, w;
int main() {
	scanf("%d", &n);
	milk.resize(n + 2); w.resize(n + 2);
	int pre = INF;
	w[0] = w[n + 1] = INF;
	for(int i = 1; i <= n; ++i) scanf("%d", &w[i]);
	
	for(int i = 1; i <= n; ++i) {
		if(w[i] > w[i - 1]) milk[i] = milk[i - 1] + 100;
		else if(w[i] == w[i - 1]) milk[i] = milk[i - 1];
		else milk[i] = 200;
	}
	int sum = 0;
	for(int i = n; i > 0; --i) {
		if(w[i] > w[i + 1]) milk[i] = milk[i + 1] + 100;
		else if(w[i] == w[i + 1]) milk[i] = milk[i + 1]; 
		sum += milk[i];
	}
	printf("%d\n", sum);
	return 0;
}

第二题

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int n, m;
int main() {
	vector<int> land;
	scanf("%d%d", &n, &m);
	land.resize(n);
	int cnt = 0, sum = 0;
	for(int i = 0; i < n; ++i) scanf("%d", &land[i]);
	for(int i = 0; i < n; ++i) {
		sum = 0;
		for(int j = i; j < n; ++j) {
			sum += land[j];
			if(sum <= m) ++cnt;
			else break;
		} 
	}
	printf("%d\n", cnt);
	return 0;
}

第三题

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int in[21], pre[21], n;
vector<int> level[21]; // L 是中序 ， 
void resolve(int L, int R, int root, int dep) {
	if(L > R) return;
	int i = L;
	while(in[i] != pre[root] && i <= R) ++i;
	level[dep].push_back(pre[root]);
	resolve(L, i - 1, root + 1, dep + 1);
	resolve(i + 1, R, root + i - L + 1, dep + 1);
}
int main() {
	scanf("%d", &n);
	for(int i = 0; i < n; ++i) scanf("%d", &in[i]);
	for(int i = 0; i < n; ++i) scanf("%d", &pre[i]);
	resolve(0, n - 1, 0, 0);
	for(int i = 0; level[i].size(); ++i) {
		if(i) printf(" %d", level[i][0]);
		else printf("%d", level[i][0]);
	}
	printf("\n");
	return 0;
}

第四题

#include<iostream>
#include<vector>
#include<queue>
#include<string>
using namespace std;
const int N = 1010;
const int INF = 0x3f3f3f3f; 
vector<vector<int>> v;
int sco[N][N], vo[N][N], in[N], t[N], dis[N], num[N], pre[N];
int n, m, cnt;
queue<int> q;
void pp(int node) {
	if(pre[node] == -1) {
		printf("%d", node);
		return;
	}
	else {
		pp(pre[node]);
		printf("->%d", node);
	}
} 
void resolve() {
	for(int i = 0; i < n; ++i) {
		pre[i] = -1;
		dis[i] = INF;
	}
	for(int i = 0; i < n; ++i) if(t[i] == 0) {
		q.push(i);
		dis[i] = 0;
	}
	while(q.size()) {
		int u = q.front(); q.pop();
		++cnt;
		for(int x : v[u]) {
			if(--t[x] == 0) q.push(x);
			if(dis[x] > dis[u] + sco[u][x]) {
				pre[x] = u;
				dis[x] = dis[u] + sco[u][x];
				num[x] = num[u] + vo[u][x];
			} else if(dis[x] == dis[u] + sco[u][x] && num[x] < num[u] + vo[u][x]) {
				pre[x] = u;
				num[x] = num[u] + vo[u][x];
			}
		}
	}
}
int a, b, c, d;
int main() {
	scanf("%d%d", &n, &m);
	v.resize(n);
	for(int i = 0; i < m; ++i) {
		scanf("%d%d%d%d", &a, &b, &c, &d);
		sco[a][b] = c; vo[a][b] = d;
		v[a].push_back(b);
		++in[b];
		++t[b];
	}
	int k, query, flag = 1;
	resolve();
	if(cnt == n) {
		printf("Okay.\n");
		flag = 0;
	} else printf("Impossible.\n");
	scanf("%d", &k);
	for(int i = 0; i < k; ++i) {
		scanf("%d", &query);
		if(in[query] == 0) printf("You may take test %d directly\n", query);
		else if(flag) printf("Error");
		else {
			pp(query);	
			printf("\n");
		} 
	}
	return 0;
}