九度OJ 1468 Sharing -- 哈希
来源:互联网 发布:python getattr 函数 编辑:程序博客网 时间:2024/05/17 18:26
题目地址:http://ac.jobdu.com/problem.php?pid=1468
- 题目描述:
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).
- 输入:
For each case, the first line contains two addresses of nodes and a positive N (<= 10^5), 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.
- 输出:
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.
- 样例输入:
11111 22222 967890 i 0000200010 a 1234500003 g -112345 D 6789000002 n 0000322222 B 2345611111 L 0000123456 e 6789000001 o 0001000001 00002 400001 a 1000110001 s -100002 a 1000210002 t -1
- 样例输出:
67890-1
/* * Main.c * * Created on: 2014年1月20日 * Author: Shaobo */#include <stdio.h> #define MAXN 100001 typedef struct node{ char data; int next;}Node; int main(void){ int first, second, N; Node word[MAXN]; char data; int addr, next, i; int len1, len2; int tfirst, tsecond; while (scanf ("%d %d %d", &first, &second, &N) != EOF){ for (i=0; i<N; ++i){ scanf ("%d %c %d", &addr, &data, &next); word[addr].data = data; word[addr].next = next; } len1 = len2 = 0; tfirst = first; tsecond = second; for (i=0; i<N; ++i){ //求得两个单词的长度 if (tfirst != -1){ ++len1; tfirst = word[tfirst].next; } if (tsecond != -1){ ++len2; tsecond = word[tsecond].next; } } while (len1 > len2){ first = word[first].next; --len1; } while (len2 > len1){ second = word[second].next; --len2; } while (len1 > 0){ if (first == second){ printf ("%05d\n", first); break; } else{ first = word[first].next; second = word[second].next; } --len1; } if (len1 == 0) printf ("-1\n"); } return 0;}
- 九度OJ 1468 Sharing -- 哈希
- 九度OJ 题目1468:Sharing
- 九度OJ-题目1468-Sharing-链表
- 九度1468 Sharing
- 九度:1468<Sharing><链表>
- 九度oj 题目1468:Sharing 【ZJU2012考研机试题2】
- 九度OnlineJudge之1468:Sharing
- 九度笔记之 1468:Sharing
- 九度OJ 1145:Candy Sharing Game(分享蜡烛游戏) (模拟)
- 【九度OJ】:九度OJ 1050
- 【九度OJ】:九度OJ 1053
- 【九度OJ】:九度OJ 1056
- 【九度OJ】:九度OJ 1059
- 【九度OJ】:九度OJ 1206
- 九度考研真题 浙大 2012-2浙大1468:Sharing
- 九度OJ:1000
- 【九度OJ】 1006
- 九度 OJ 1499
- Android/java 读写文件
- MSR和MRS 指令
- VC MFC 调整 TAb键序
- STL学习笔记1 List
- 大蛇继续
- 九度OJ 1468 Sharing -- 哈希
- 小强的HTML5移动开发之路(34)——jQuery中的选择器
- 基于BOLT的仿迅雷加速器界面开发(二)
- Xcode5 运行程序 提示“iOS 模拟器”未能安装此应用程序
- c:forEach varStatus="status"
- JQery里JS中showModalDialog 详细使用
- iBatis/MyIBatis学习网站推荐
- 贪心水题
- 数据结构与算法8:图的深度优先搜索