pat_1032
来源:互联网 发布:java代码模拟http请求 编辑:程序博客网 时间:2024/05/22 00:09
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}, andNext 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<cstring>using namespace std;int point[100010];int num[100010];int main(){int s,t,N,i;int a,c;char b;cin>>s>>t>>N;memset(point,-1,sizeof(point));memset(num,0,sizeof(num));for(i = 0;i < N;i++){cin>>a>>b>>c;if(c != -1){point[a] = c;num[c]++;}}int s1 = s;int t1 = t;s = 100005;t = 100006;point[s] = s1;point[t] = t1;num[s1]++;num[t1]++;s1 = s;t1 = t;int res = -1;while(point[s1] != -1){if(num[point[s1]] >= 2){while(point[t1] != -1){if(point[t1] == point[s1]){res = point[s1];break;}t1 = point[t1];}t1 = t;}s1 = point[s1];}if(res != -1)printf("%05d\n",res);else printf("-1\n");return 0;}
- pat_1032
- PAT_1032: Sharing
- PAT_1032. Sharing(自己的代码最后一个case没过)
- Adding a simple io device
- experiment : 解决vs2008不能安装的问题
- 编译Linux内核时出现“fatal error: linux/netfilter/xt_dscp: No such file or directory”
- 应用程序通用开发框架
- 使用 Python 进行线程编程
- pat_1032
- 编程能力的四种境界
- /etc/fstab 参数详解及如何设置开机自动挂载
- [Leetcode] Maximum Subarray
- 解决电脑网络受限制或无连接造成无法上网的方法
- 人生如同故事 重要的并不在于有多长 而是在于有多好
- 实验十 SCVMM创建虚拟机
- QR二维码--实现代码
- 数据类型之间的自动转换