PAT (Advanced Level) Practice
关注
分享
扫一扫
Yo3ngLau
Grazie
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
1148 Werewolf - Simple Version (20分)
1148 Werewolf - Simple Version (20分)题目要求狼人杀游戏，两只狼，一狼一人说谎，找出两只狼解题思想word[I]记录第I个人说的话identity[i]表示某个人的身份lie[I]存放说谎的人word[k] * identity[abs(word[k])] < 0表示第k个人在说谎identity[lie[0]]+identity[lie[1...原创 2020-02-14 12:43:44 · 112 阅读 · 0 评论 -
1150 Travelling Salesman Problem (25分)
1150 Travelling Salesman Problem (25分)题目要求旅行商问题给定路径判断是否为旅行商路径、旅行商简单路径、非旅行商路径最后输出最短旅行商路径解题思想isConnect判断是否存在路径isTS判断是否为旅行商路径isSimple判断是否为简单旅行商路径AC代码#include <iostream>#include <cstd...原创 2020-02-13 12:56:51 · 136 阅读 · 0 评论 -
1145 Hashing - Average Search Time (25分)
1145 Hashing - Average Search Time (25分)解题思想AC代码#include <iostream>#include <vector>#include <cmath>using namespace std;bool isPrime(int x) { int ret = true; for (int ...原创 2019-12-07 09:42:33 · 112 阅读 · 0 评论 -
1110 Complete Binary Tree (25分)
1110 Complete Binary Tree (25分)解题思想AC代码#include <iostream>#include <cstdio>#include <string>#include <cstdlib>using namespace std;struct node{ int id, l, r, index, ...原创 2019-12-07 09:03:50 · 130 阅读 · 0 评论 -
1147 Heaps (30分)
1147 Heaps (30分)解题思想AC代码#include <iostream>#include <vector>#include <cstdio>using namespace std;int m, n;vector<int> v;vector<int> ret;void post_order(int inde...原创 2019-12-06 22:53:43 · 130 阅读 · 0 评论 -
1007 Maximum Subsequence Sum (25分)
1007 Maximum Subsequence Sum (25分)解题思想AC代码#include <iostream>#include <cstdio>using namespace std;int arr[10010];int tmphead, head, tail, Max, sum;bool flag = true;void MCAS(int a...原创 2019-12-06 22:24:29 · 107 阅读 · 0 评论 -
1155 Heap Paths (30分)
1155 Heap Paths (30分)解题思想AC代码#include <iostream>#include <vector>using namespace std;vector<int> v;int a[1010], n, isMin = 1, isMax = 1;void dfs(int index){ if (index*2&g...原创 2019-12-06 22:23:41 · 143 阅读 · 0 评论 -
1142 Maximal Clique (25 分)
1142 Maximal Clique (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>#include <cstring>using namespace std;int e[210][210];int hashs[210];int main()...原创 2019-12-03 12:09:22 · 87 阅读 · 0 评论 -
1146 Topological Order (25 分)
1146 Topological Order (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>using namespace std;vector<vector<int> > g;vector<int> const_inDeg...原创 2019-12-03 11:36:40 · 110 阅读 · 1 评论 -
1140 Look-and-say Sequence (20 分)
1140 Look-and-say Sequence (20 分)解题思想AC代码#include <iostream>#include <cstdio>#include <string>using namespace std;int main(){ string ori; int step, j; cin >>...原创 2019-12-03 00:42:45 · 109 阅读 · 0 评论 -
1093 Count PAT's (25 分)
1093 Count PAT’s (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <string>using namespace std;int main(){ string ori; cin >> ori; int countt = 0, c...原创 2019-12-02 23:37:17 · 129 阅读 · 0 评论 -
1126 Eulerian Path (25 分)
1126 Eulerian Path (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>using namespace std;int n, m, cnt = 0;vector<vector<int> > edge;vector<b...原创 2019-12-02 21:05:21 · 118 阅读 · 0 评论 -
1139 First Contact (30 分)
1139 First Contact (30 分)解题思想AC代码#include <iostream>#include <vector>#include <cstdio>#include <cmath>#include <algorithm>#include <string>using namespace ...原创 2019-12-02 18:48:09 · 452 阅读 · 0 评论 -
1135 Is It A Red-Black Tree (30 分)
1135 Is It A Red-Black Tree (30 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>#include <cmath>using namespace std;vector<int> arr;struct node{ ...原创 2019-12-02 12:32:00 · 132 阅读 · 0 评论 -
1134 Vertex Cover (25 分)
1134 Vertex Cover (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>#include <cstring>using namespace std;struct edge{ int a, b;};int main(){ ...原创 2019-12-02 00:35:46 · 112 阅读 · 0 评论 -
1154 Vertex Coloring (25 分)
1154 Vertex Coloring (25 分)解题思想AC代码#include <iostream>#include <vector>#include <unordered_set>using namespace std;struct edge{ int a, b;};int main(){ int n, m, k; ...原创 2019-12-02 00:07:02 · 86 阅读 · 0 评论 -
1141 PAT Ranking of Institutions (25 分)
1141 PAT Ranking of Institutions (25 分)解题思想AC代码#include <iostream>#include <vector>#include <string>#include <unordered_map>#include <algorithm>#include <cstdi...原创 2019-11-29 16:48:53 · 158 阅读 · 0 评论 -
1149 Dangerous Goods Packaging (25 分)
1149 Dangerous Goods Packaging (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <unordered_set>#include <unordered_map>#include <vector>using namespace ...原创 2019-11-29 15:40:00 · 121 阅读 · 0 评论 -
1153 Decode Registration Card of PAT (25 分)
1153 Decode Registration Card of PAT (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <algorithm>#include <unordered_map>#include <string>using namespac...原创 2019-11-29 01:14:46 · 102 阅读 · 0 评论 -
1137 Final Grading (25 分)
1137 Final Grading (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <algorithm>#include <unordered_map>#include <vector>#include <string>using na...原创 2019-11-28 22:27:36 · 106 阅读 · 0 评论 -
1121 Damn Single (25 分)
1121 Damn Single (25 分)解题思想AC代码(方法一)#include <iostream>#include <cstdio>#include <map>#include <set>using namespace std;map<int, int> mp;set<int> s, ret;i...原创 2019-11-28 20:33:53 · 130 阅读 · 0 评论 -
1106 Lowest Price in Supply Chain (25 分)
1106 Lowest Price in Supply Chain (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <cmath>#include <vector>#define inf 0x3f3f3f3fusing namespace std;vector&l...原创 2019-11-28 01:15:29 · 178 阅读 · 0 评论 -
1151 LCA in a Binary Tree (30 分)
1151 LCA in a Binary Tree (30 分)解题思想AC代码#include <iostream>#include <vector>#include <map>using namespace std;map<int, int> pos;vector<int> in, pre;void LCA(int ...原创 2019-11-28 00:17:48 · 187 阅读 · 0 评论 -
1130 Infix Expression（25 分）
1130 Infix Expression (25 分)解题思想AC代码#include <iostream>#include <string>using namespace std;struct node{ string data; int l, r;}a[100];string dfs(int root){ if (a[root]...原创 2019-11-27 21:40:15 · 119 阅读 · 0 评论 -
1094 The Largest Generation (25 分)
1094 The Largest Generation (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>using namespace std;const int MAXN = 110;int book[MAXN];vector<int> v[MA...原创 2019-11-27 19:44:19 · 86 阅读 · 0 评论 -
1143 Lowest Common Ancestor (30 分)
1143 Lowest Common Ancestor (30 分)解题思想AC代码#include <iostream>#include <cstdio>#include <map>#include <vector>using namespace std;map<int, bool> mp;int main(){ ...原创 2019-11-27 18:25:03 · 91 阅读 · 0 评论 -
1091 Acute Stroke (30 分)
1091 Acute Stroke (30 分)解题思想AC代码#include <iostream>#include <cstdio>#include <queue>using namespace std;int m, n, l, t;int arr[1300][130][80];bool visit[1300][130][80];int ...原创 2019-11-27 17:06:27 · 153 阅读 · 0 评论 -
1138 Postorder Traversal (25 分)
1138 Postorder Traversal (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>using namespace std;bool flag = false;vector<int> pre, in;void post_order(i...原创 2019-11-27 11:51:44 · 74 阅读 · 0 评论 -
1111 Online Map (30 分)
1111 Online Map (30 分)解题思想AC代码#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#define inf 0x3f3f3f3fusing namespace std;const int MAXN = 510;...原创 2019-11-27 11:18:01 · 250 阅读 · 0 评论 -
1087 All Roads Lead to Rome (30 分)
1087 All Roads Lead to Rome (30 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>#include <algorithm>#include <map>#define inf 0x3f3f3f3fusing name...原创 2019-11-27 00:03:10 · 134 阅读 · 0 评论 -
1030 Travel Plan (30 分)
1030 Travel Plan (30 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>#include <algorithm>#define inf 0x3f3f3f3fusing namespace std;const int MAXN = 510;...原创 2019-11-26 21:31:14 · 124 阅读 · 0 评论 -
1043 Is It a Binary Search Tree (25 分)
1043 Is It a Binary Search Tree (25 分)解题思想AC代码#include <iostream>#include <cstdio>#include <vector>using namespace std;bool isMirror;vector<int> pre, post;void getpost...原创 2019-11-25 11:41:03 · 132 阅读 · 0 评论 -
1099 Build A Binary Search Tree (30 分)
1099 Build A Binary Search Tree (30 分)解题思想AC代码#include <iostream>#include <algorithm>#include <cstdio>using namespace std;int n, cnt, b[100];struct node{ int data, l, r, ...原创 2019-11-25 11:41:08 · 90 阅读 · 0 评论 -
1119 Pre- and Post-order Traversals (30 分)
1119 Pre- and Post-order Traversals (30 分)解题思想AC代码#include <iostream>#include <vector>using namespace std;vector<int> in, pre, post;bool uniquee = true;void getIn(int preLeft...原创 2019-11-25 11:25:44 · 111 阅读 · 0 评论 -
1102 Invert a Binary Tree (25 分)
1102 Invert a Binary Tree (25 分)解题思想AC代码#include <iostream>#include <vector>#include <algorithm>using namespace std;struct node { int id, l, r, index, level;} a[100];vec...原创 2019-11-25 11:23:59 · 99 阅读 · 0 评论 -
1003 Emergency (25 分)
1003 Emergency (25 分)解题思想朴素版Dijkstra邻接矩阵e[a][b]和e[b][a]存储a与b的边权weight[i]存储i点的点权dis[i]存储从源点到i点的当前最短距离 算法结束前并不是最终答案num[i]存储从源点到i点最短路径的条数w[i]存储从源点到i点最短路径中点权最大和visit[I]标记i点是否已访问代码#include <io...原创 2019-11-25 11:12:26 · 92 阅读 · 0 评论 -
1057 Stack (30 分)
1057 Stack (30 分)目录1057 Stack (30 分)结题思想AC代码TLE代码结题思想一、排序查询会TLE二、树状数组解题树状数组模板三、二分查找中位数四、思想对于push的点 单点更新树状数组以该点为下标的值为1对于pop的点 单点更新树状数组以该点为下标的值为-1想得到某一时刻栈中有s.size()个数值的中位数即在树状数组中寻找(二分查找)从头开始第...原创 2019-11-23 17:28:53 · 261 阅读 · 0 评论 -
1107 Social Clusters (30 分)
1107 Social Clusters (30 分)解题思想朋友圈个数即为连通分支个数即pre[I] == I注意：要利用unordered_set存储所有爱好标识号 以便遍历每一个爱好每个朋友圈的人数求法：遍历每个人 访问其爱好的最大祖先find(infp[p][1])与当前连通分支最大祖先相比较如为同一祖先 则该朋友圈人数加一到这里讲解结束AC代码#include &l...原创 2019-11-23 10:07:18 · 115 阅读 · 0 评论 -
1118 Birds in Forest (25 分)
1118 Birds in Forest (25 分)解题思想有几棵树==有几个连通分支求连通分支个数 遍历每个i若pre[i]==i即本身为最大共同最大祖先 则代表有一个连通分支有多少最大祖先即有有多少个连通分支技巧：将每张照片的第一个鸟作为最大祖先 后面的鸟与其做连接鸟的数量==最大编号是否在一棵树上==是否有共同最大祖先到这里讲解结束AC代码#include <i...原创 2019-11-22 09:26:34 · 132 阅读 · 0 评论 -
1086 Tree Traversals Again (25 分)
1086 Tree Traversals Again (25 分)题目入口：https://pintia.cn/problem-sets/994805342720868352/problems/994805380754817024解题思想注意到push的顺序即为先序遍历顺序pop的顺序即为中序遍历顺序已知先序中序求后序到这里讲解结束AC代码#include <iostream...原创 2019-11-21 23:52:41 · 103 阅读 · 0 评论