1032. Sharing (25) PAT

最新推荐文章于 2020-06-06 11:08:02 发布

zhangchaosd

最新推荐文章于 2020-06-06 11:08:02 发布

阅读量171

点赞数

本文链接：https://blog.csdn.net/rzdyzx/article/details/78148501

版权

1032. Sharing (25)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 (<= 10⁵), 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 9
67890 i 00002
00010 a 12345
00003 g -1
12345 D 67890
00002 n 00003
22222 B 23456
11111 L 00001
23456 e 67890
00001 o 00010

Sample Output 1:

Sample Input 2:

00001 00002 4
00001 a 10001
10001 s -1
00002 a 10002
10002 t -1

Sample Output 2:

-1

思路：两个数组，sz1用来存每个节点的下一个节点的位置，在遍历第一个链表的时候在sz2中把经过的节点记为-1。遍历第二个链表的时候看sz2中的位置是不是-1，遇到-1就break就是开始重复的节点

#include<cstdio>
using namespace std;

int main()
{
	int sz1[100000],sz2[100000];
	int l1start,l2start,n,i,j;
	scanf("%d %d %d",&l1start,&l2start,&n);
	int t1,t3;
	char t2;
	for(i=0;i<n;i++){
		scanf("%d %c %d",&t1,&t2,&t3);	
		sz1[t1]=t3;
	}
	i=l1start;
	while(i!=-1){
		sz2[i]=-1;
		i=sz1[i];
	}
	i=l2start;
	while(i!=-1){
		if(sz2[i]==-1)break; 
		i=sz1[i];
	}
	if(i==-1)printf("-1");
	else printf("%05d",i);
	return 0;
}