72人阅读 评论(0)

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 (<= 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 Nextis 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:
67890

Sample Input 2:
00001 00002 4
00001 a 10001
10001 s -1
00002 a 10002
10002 t -1

Sample Output 2:
-1
#include<stdio.h>

struct node{
char data;
int next;
int visited;
} word[100000];

int main(){
int start[2];
struct node temp;
int n;
scanf("%d %d %d", &start[0], &start[1], &n);
while (n--){
scanf("%d %c %d", &temp.address, &temp.data, &temp.next);
}
while (start[0] != -1){
word[start[0]].visited = 1;
start[0] = word[start[0]].next;
}
while (1){
if (start[1] == -1){
printf("-1\n");
break;
}
else if (word[start[1]].visited == 1){
printf("%05d\n", start[1]);
break;
}
start[1] = word[start[1]].next;
}
return 0;
}

0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：6402次
• 积分：520
• 等级：
• 排名：千里之外
• 原创：47篇
• 转载：3篇
• 译文：0篇
• 评论：2条
阅读排行
最新评论