2020年03月_睡不着kkk

原创 PAT | A1147 Heaps

#include <iostream>#include <vector>using namespace std;vector<int> postOrder;int keys[1010];int m,n;int isHeap(){ int heap = -1; int i = 0; // 从0开始遍历 while(2 * i + 1 &lt...

2020-03-31 11:55:48 80

原创 PAT | A1146 Topological Order

#include <iostream>#include <vector>#include <unordered_set>using namespace std;bool G[1010][1010];int topo[1010];unordered_set<int> vis;vector<int> res;int ma...

2020-03-31 11:21:12 66

原创 PAT | A1145 Hashing - Average Search Time

while(!isPrime(MSize))写成了if(!isPrime(MSize))找了我一个小时。。#include <iostream>#include <math.h>#include <algorithm>using namespace std;int hashTable[10010];bool isPrime(int...

2020-03-31 10:54:01 80

原创 PAT | A1144 The Missing Number

#include <iostream>#include <unordered_set>#include <algorithm>using namespace std;unordered_set<int> numbers;int main(){ int n; scanf("%d",&n); for(int i = 0;i ...

2020-03-30 12:17:21 65

原创 PAT | A1143 Lowest Common Ancestor

先建立一个BST树后再找LCA会导致最后三个测试点超时可以直接遍历先序序列：由于先序序列永远先访问子树根节点，所以第一个找到的u<root<v或u>root>v一定是u和v的LCA；若先找到u或先找到v，则先找到的那个一定是另一个的祖先。#include <iostream>#include <unordered_set>#include ...

2020-03-30 12:03:28 125

原创 PAT | A1142 Maximal Clique

#include <iostream>#include <vector>#include <unordered_set>using namespace std;bool G[210][210];vector<int> clique;unordered_set<int> C;int isClique(int n){ /...

2020-03-30 11:07:05 81

原创 PAT | A1141 PAT Ranking of Institutions

这道题如果在每一次读取的时候更新分数就把它强制转换成int，测试点5会答案错误#include <iostream>#include <string>#include <unordered_map>#include <vector>#include <algorithm>using namespace std;struc...

2020-03-30 10:25:56 106

原创 PAT | A1140 Look-and-say Sequence

#include <iostream>#include <string>using namespace std;int main(){ string str; int n; cin>>str; scanf("%d",&n); for(int i = 1;i < n;i++){ int len = str.length();...

2020-03-29 13:20:10 69

原创 PAT | A1139 First Contact（待优化）

一开始的思路：从源点开始进行深度不超过3的DFS，深度到达3时判断是否到达终点，到达则记录当前路径。想得太复杂了，且最后有三个点答案错误，也没有考虑正负零的差别。一开始的代码：#include <iostream>#include <unordered_set>#include <vector>#include <stack>#inc...

2020-03-29 13:06:16 195

原创 PAT | A1138 Postorder Traversal

#include <iostream>using namespace std;int preOrder[50010];int inOrder[50010];int findFirst(int preL,int preR,int inL,int inR){ int root = preOrder[preL]; if(preL == preR) return root...

2020-03-29 10:55:55 67

原创 PAT | A1137 Final Grading

#include <iostream>#include <string>#include <vector>#include <unordered_map>#include <algorithm>using namespace std;struct Student{ string name; int online; i...

2020-03-29 10:31:56 115

原创 PAT | A1136 A Delayed Palindrome

#include <iostream>#include <string>#include <algorithm>using namespace std;string process(string num,string reverseNum){ int len = num.length(); int c = 0; printf("%s + %s ...

2020-03-28 13:51:47 110

原创 PAT | A1135 Is It A Red-Black Tree

一开始是用动态链表做的，怎么都过不了，第二次看了网上柳婼大神的代码，用指针做过了。附柳婼大神链接动态链表代码：#include <iostream>#include <vector>#include <stack>#include <algorithm>using namespace std;struct Node{ int d...

2020-03-28 12:54:35 120

原创 PAT | A1134 Vertex Cover

#include <iostream>#include <unordered_set>#include <vector>using namespace std;struct Road{ int u,v;};Road roads[10010];unordered_set<int> vertice;int main(){ in...

2020-03-28 10:49:25 95

原创 PAT | A1133 Splitting A Linked List

#include <iostream>#include <vector>using namespace std;struct Node{ int address; int data; int next;};Node nodes[100010];vector<Node> res;int main(){ int beginAddress...

2020-03-28 10:20:38 67

原创 PAT | A1132 Cut Integer

注意除数有可能为0的情况#include <iostream>#include <string>#include <sstream>using namespace std;int main(){ int n; scanf("%d",&n); for(int i = 0;i < n;i++){ string str,str1,...

2020-03-27 15:00:11 63

原创 PAT | A1131 Subway Map（待优化）

最后一个测试点超时#include <iostream>#include <vector>#include <unordered_set>#include <algorithm>#include <climits>using namespace std;struct Road{ int station; int li...

2020-03-27 14:40:04 178

原创 PAT | A1130 Infix Expression

注意：如果没考虑只有一个根节点的情况，测试点2会出错#include <iostream>#include <string>#include <algorithm>using namespace std;struct Node{ string data; int lchild,rchild;};Node nodes[25];bool i...

2020-03-27 13:11:27 87

原创 PAT | A1127 ZigZagging on a Tree（待优化）

不太明白自己哪里写错了，路过的大佬如果看出来请告知建树后层序遍历，根据不同的层分别顺序或逆序输出#include <iostream>#include <vector>#include <queue>#include <algorithm>using namespace std;struct Node{ int data; in...

2020-03-26 11:57:40 58

原创 PAT | A1128 N Queens Puzzle

最后一个测试点数据量大，如果不做剪枝会超时#include <iostream>using namespace std;bool G[1010][1010];int main(){ int k; scanf("%d",&k); for(int i = 0;i < k;i++){ for(int i = 0;i < 1010;i++) f...

2020-03-26 11:43:18 82

原创 PAT | A1126 Eulerian Path

如果不考虑图是否是连通图，则测试点3会答案错误#include <iostream>#include <algorithm>#include <unordered_set>#include <queue>using namespace std;bool G[510][510];int degree[510];unordered_s...

2020-03-26 09:55:34 79

原创 PAT | A1125 Chain the Ropes

一开始把题目想复杂了，如果两个绳子连在一起后长度减半，则该减半的长度一定是所有绳子中最小的长度。#include <iostream>#include <algorithm>using namespace std;int seq[10010];int main(){ int n; scanf("%d",&n); fill(seq,seq + 1...

2020-03-26 09:20:12 103

原创 PAT | A1124 Raffle for Weibo Followers

#include <iostream>#include <unordered_set>#include <string>using namespace std;unordered_set<string> awarded;int main(){ int m,s,n; scanf("%d%d%d",&m,&s,&amp...

2020-03-25 14:53:23 60

原创 PAT | A1121 Damn Single

对unordered_set无法直接存放结构体问题的解决#include <iostream>#include <vector>#include <set>#include <unordered_set>using namespace std;struct Couple{ int husband,wife;};namespa...

2020-03-25 10:45:16 82

原创 PAT | A1120 Friend Numbers

#include <iostream>#include <string>#include <set>using namespace std;set<int> friends;int main(){ int n; scanf("%d",&n); for(int i = 0;i < n;i++){ string s...

2020-03-24 14:12:37 185

原创 PAT | A1119 Pre- and Post-order Traversals

#include <iostream>#include <vector>#include <stack>using namespace std;struct Node{ int data; int lchild; int rchild;};int pre[40];int post[40];vector<Node> node...

2020-03-24 14:02:25 62

原创 PAT | A1118 Birds in Forest

并查集#include <iostream>#include <unordered_set>using namespace std;int pre[100000];unordered_set<int> birds;int unionSearch(int root){ int son,tmp; son = root; while(root ...

2020-03-24 12:07:35 74

原创 PAT | A1117 Eddington Number

这题真的不太好懂，可能也是我英文不好吧题目是要求一个最大的E，使得有E天跑步距离大于E（注意是大于！不是大于等于！）没注意这个会只有两个测试点对#include <iostream>#include <vector>#include <algorithm>using namespace std;vector<int> miles;...

2020-03-24 11:32:11 113

原创 PAT | A1116 Come on! Let's C

给出名次，第一得到Mystery Award,排名为素数的人得到Minion，其他人得到Chocolate#include <iostream>#include <unordered_set>#include <unordered_map>using namespace std;unordered_set<int> contestant...

2020-03-23 13:46:53 86

原创 PAT | A1115 Counting Nodes in a BST

#include <iostream>#include <vector>#include <queue>using namespace std;struct Node{ int data; int lchild,rchild;};vector<Node> nodes;int lowest = 0;int secondLowe...

2020-03-23 13:20:17 106

原创 PAT | A1114 Family Property

并查集#include <iostream>#include <unordered_map>#include <vector>#include <algorithm>using namespace std;struct Family{ int numOfMembers; int numOfHouses; int totalAre...

2020-03-23 12:41:36 157

原创 PAT | A1113 Integer Set Partition

#include <iostream>#include <algorithm>using namespace std;int seq[100010];int main(){ int n; scanf("%d",&n); for(int i = 0;i < n;i++){ scanf("%d",&seq[i]); } sort...

2020-03-23 10:58:31 64

原创 PAT | A1112 Stucked Keyboard

#include <iostream>#include <string>#include <vector>#include <unordered_set>using namespace std;unordered_set<char> stuck;unordered_set<char> imposStuck;v...

2020-03-22 15:54:15 105

原创 PAT | A1111 Online Map

2次Dijkstra一定要好好看题鸭哭哭，看到在最短距离相同时选择最快的路，就想当然的认为在最短时间相同时选择最短的路，会导致测试点2错误。#include <iostream>#include <vector>#include <climits>#include <algorithm>using namespace std;int...

2020-03-22 15:19:34 238

原创 PAT | A1110 Complete Binary Tree

#include <iostream>#include <string>#include <algorithm>#include <sstream>using namespace std;struct Node{ int parent; int lchild,rchild;};struct returnType{ bool ...

2020-03-22 13:52:04 122

原创 PAT | A1109 Group Photo

Visual Studio我吹爆：）#include <iostream>#include <string>#include <vector>#include <algorithm>using namespace std;struct People{ string name; int height;};People rows...

2020-03-22 12:29:16 94

原创 PAT | A1106 Lowest Price in Supply Chain

今天是学着用codeBlocks的一天#include <iostream>#include <stdio.h>#include <vector>#include <queue>#include <climits>#include <cmath>using namespace std;struct Node...

2020-03-21 10:33:41 57

原创 PAT | A1105 Spiral Matrix（待优化）

测试点1和3答案错误，看不出来哪错了。。#include <iostream>#include <vector>#include <algorithm>#include <cmath>using namespace std;vector<int> seq;int res[1000][1000];bool cmp(i...

2020-03-20 15:02:12 92

原创 PAT | A1104 Sum of Number Segments

#include <iostream>#include <vector>using namespace std;int main(){ int n; scanf("%d",&n); double sum = 0; for(int i = 0;i < n;i++){ double temp; scanf("%lf",&temp)...

2020-03-20 14:04:04 56

原创 PAT | A1102 Invert a Binary Tree

直接将层序遍历和中序遍历的lchild和rchild互换就好#include <iostream>#include <queue>#include <vector>using namespace std;struct Node{ int lchild,rchild; int parent;};Node nodes[15];vector&...

2020-03-20 11:34:54 58

breathCancer.xlsx

CodeBlocks强制类型转换，求大神

CCF 317号子任务 运行错误 0分

CCF 317号子任务运行错误 0分