PAT甲级1032
来源:互联网 发布:监控app软件排行 编辑:程序博客网 时间:2024/06/04 19:02
1032. Sharing (25)
To store English words, one method is to use linked lists and store a word letter by letter. To save some space, we may let the words share the same sublist if they share the same suffix. For example, "loading" and "being" are stored as showed in Figure 1.
Figure 1
You are supposed to find the starting position of the common suffix (e.g. the position of "i" in Figure 1).
Input Specification:
Each input file contains one test case. For each case, the first line contains two addresses of nodes and a positive N (<= 105), where the two addresses are the addresses of the first nodes of the two words, and N is the total number of nodes. The address of a node is a 5-digit positive integer, and NULL is represented by -1.
Then N lines follow, each describes a node in the format:
Address Data Next
where Address is the position of the node, Data is the letter contained by this node which is an English letter chosen from {a-z, A-Z}, and Next is the position of the next node.
Output Specification:
For each case, simply output the 5-digit starting position of the common suffix. If the two words have no common suffix, output "-1" instead.
Sample Input 1:11111 22222 967890 i 0000200010 a 1234500003 g -112345 D 6789000002 n 0000322222 B 2345611111 L 0000123456 e 6789000001 o 00010Sample Output 1:
67890Sample Input 2:
00001 00002 400001 a 1000110001 s -100002 a 1000210002 t -1Sample Output 2:
-1
#include<iostream>#include<cstdio>#include<queue>#include<vector>#include<algorithm>using namespace std;struct LinkNode{int address, next;char data;};int a[100000];int main(){fill(a, a + 100000, -1);//用于链接int start1, start2, N;cin >> start1 >> start2 >> N;LinkNode ln;//vector<LinkNode> v;for (int i = 0; i < N; i++){cin >> ln.address >> ln.data >> ln.next;//v.push_back(ln);a[ln.address] = ln.next;}int start = start1, len1 = 0, len2 = 0;while (start!=-1){len1++; start = a[start];}start = start2;while (start != -1){len2++; start = a[start];}int difference = abs(len1 - len2);if (len2 > len1){swap(start1, start2);}//以便于之后统一处理,总使得第一个单词长度不短于第二个单词start = start1; int startt = start2;int i = 0;while (start != -1){if (start == startt)break;if (i >=difference){startt = a[startt];}start = a[start];i++;}//cout << start;if (start != -1)printf("%05d", start);elseprintf("-1");return 0;}/*这个就是先找出两个单词的距离之差,然后让长的先移这么多。之后再同步移,并比较地址*/
- PAT(甲级)1032
- 浙大PAT甲级 1032
- PAT甲级1032
- 浙大PAT甲级-1032
- PAT甲级 1032
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- SDWebImage源码解读 之SDWebImageDownloaderOperation
- python 界面编程 并执行sh命令
- 存储过程与触发器的区别
- codeforces 760E or 759C 【线段树维护后缀和】
- 三 . css语法、样式表
- PAT甲级1032
- 重载与重写
- spring boot 学习(五)SpringBoot+MyBatis(XML)+Druid
- 指针数组&数组指针
- 你的管理,为什么没带出优秀的团队?
- 最近使用频率较高的linux命令
- (六)play之yabe项目【验证码】
- new操作符(翻译自mozilla.org)
- SparkRDD的一些使用经验