Problem 1994 --Sharing

## 1994: Sharing

Time Limit: 1 Sec  Memory Limit: 32 MB
Submit: 79  Solved: 19
[Submit][Status][Web Board][Creator:][下载FPS1元][添加到购物车][下载测试数据1元][52kb]

## Description

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

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:

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

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

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

67890

## HINT

struct NodeType{

int flag, next;

};

1）定义数据结构；

2）读取结点信息；

3）标记第一个列表的路径；

4）遍历第二个列表，一旦遇到第一个节点元素则停止遍历；

5）输出相应的结果。

[Submit][Status]