PAT-甲级-题解目录

甲级题目目录

编号	题目	分数	类型	日期
1004	Counting Leaves	30	树的遍历→保存每层叶子节点数	19-07-18
1053	Path of Equal Weight	30		19-07-24
1079	Total Sales of Supply Chain	25		19-07-25
1086	Tree Traversals Again	25		19-07-26
1090	Highest Price in Supply Chain	25		19-07-26
1094	The Largest Generation	25		19-07-26
1102	Invert a Binary Tree	25		19-07-26
1106	Lowest Price in Supply Chain	25		19-07-26
1115	Counting Nodes in a BST	30	二叉搜索树	19-07-27
1043	Is It a Binary Search Tree	25	(*) 随机序列 → 建立BST二叉搜索树	19-07-27
1064	Complete Binary Search Tree	30		19-07-27
1099	Build A Binary Search Tree	30	二叉搜索树	19-07-28
1110	Complete Binary Tree	25	(*) BFS→BST完全二叉树	19-07-29
1020	Tree Traversals	25	(*) 后序+中序→层序	19-08-02
1127	ZigZagging on a Tree	30	(*) 中序+后序→层序	19-07-29
1130	Infix Expression	25	(*) 中序+dfs→中缀表达式	19-07-29
1138	Postorder Traversal	25	(*) 前序+中序→后序	19-07-29
1143	Lowest Common Ancestor	30	(*) BST中找LCA	19-07-30
1151	LCA in a Binary Tree	30	(*) 中序+先序中找LCA	19-07-30
1066	Root of AVL Tree	25	(*) AVL平衡二叉树的模板	19-07-31
1123	Is It a Complete AVL Tree	30	AVL+BFS+BST的判断
1135	Is It A Red-Black Tree	30	二叉搜索树+计算二叉树的高度
1147	Heaps	30	(*) CBT完全二叉树+层序→堆的判断
1155	Heap Paths	30	(*) CBT完全二叉树的路径
-----	-------------------图相关题目------------------	----	------------------------------------------------	-----------
1018	Public Bike Management	30	<#> 双标尺(边权+点权)→最短路径dijkstra+dfs	19-08-03
1030	Travel Plan	30	<#> 双标尺(边权+边权)→最短路径dijkstra+dfs	19-08-04
1087	All Roads Lead to Rome	30	<#> 双标尺(边权+点权)→最短路径dijkstra+dfs	19-08-04
1111	Online Map	30	<#> 两次Dijkstra+dfs	19-08-05
1131	Subway Map	30	<#> 图的最短路径
1013	Battle Over Cities	25	<#> 计算图的连通分量	19-08-05
1021	Deepest Root	25
1003	Emergency	25	<#> Dijkstra
1034	Head of a Gang	30	<#> 计算连通分量+找子图中边权最大点
1072	Gas Station	30	<#> 多源最短路径dijkstra
1076	Forwards on Weibo	30	<#> 图的遍历→BFS
1122	Hamiltonian Cycle	25	<#> 图判断路径→哈密顿回路
1126	Eulerian Path	25	<#> 图判断路径→欧拉路径	❌
1114	Family Property	25	<#> 并查集
1118	Birds in Forest	25	<#> 并查集

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

编号	题目	分值	类型	ACday
1001	A+B Format	20	字符串	7.16
1002	A+B for Polynomials	25	map的应用	7.16
1003	Emergency	25	最短路径、Dijkstra的应用	7.18
1004	Counting Leaves	30	vector建树+DFS深搜	7.19
1005	Spell It Right	20	字符串	7.16
1006	Sign In and Sign Out	25	map的应用	7.17
1007	Maximum Subsequence Sum	25	最大子序列	7.17
1008	Elevator	20	模拟题	7.19
1009	Product of Polynomials	25	数学模拟	7.19
1010	Radix	25	进制转换、二分法	7.20
1013	Battle Over Cities	25	图论-计算连通分量	7.20

 

 

 

 

 

 

 

 

 

 

 

 

 

 

解题常用空白模板

#include <iostream>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <stack>
using namespace std;

#define rep(i,j,k) for(int i=j;i<k;i++)

void read(){
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
}
int main(){
    read();
    std::ios::sync_with_stdio(false);
    return 0;
}

 

 

 

---