Sharing
来源:互联网 发布:枪机摄像头网络拓扑图 编辑:程序博客网 时间:2024/06/05 18: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<stdio.h>#include<string.h>const int maxn=100010;struct NODE{char data;int next;bool flag;}node[maxn];int main(){for(int i=0;i<maxn;i++){node[i].flag=false; } int s1,s2,n;scanf("%d%d%d",&s1,&s2,&n);int address,next;char data;for(int i=0;i<n;i++){scanf("%d %c %d",&address,&data,&next);;node[address].data=data;node[address].next=next;}int p;for(p=s1;p!=-1;p=node[p].next){node[p].flag=true;}for(p=s2;p!=-1;p=node[p].next){if(node[p].flag==true) break;}if(p!=-1){printf("%05d\n",p);}else{printf("-1\n");}return 0;}
- sharing
- Sharing
- Sharing
- Sharing
- runtime sharing
- Internal sharing
- Sharing Resources
- Sharing chocolate
- 1032:Sharing
- PAT_1032: Sharing
- false sharing
- Sharing Files
- 1032. Sharing
- 1032. Sharing
- False Sharing
- 1032.Sharing
- pat1032 Sharing
- false sharing
- Android Studio 使用SVN管理代码
- Elasticsearch、MongoDB和Hadoop比较。
- weblogic 连接池 大量的出现SELECT 1 FROM DUAL
- C/C++中的关键字
- 51nod 1109 01组成的N的倍数 (bfs)
- Sharing
- 湖南省第十一届大学生计算机程序设计竞赛 Problem H 聊天止于呵呵(字符串处理)
- Accelerated 12 Str (Making class objects act like values)
- Quartz总结
- 解决所有字符乱码问题
- 编译安装mysql
- mysql取某个范围内的随机时间
- 9-1NOIP模拟赛总结
- 信息解码, 紫书P83UVa213(进制转换非常经典的题目)