1032. Sharing
2015-11-30 19:19
417 查看
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:
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:
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> #include<string.h> #include<algorithm> using namespace std; int nodes[100002]; int nodes_ans[100002]; int main() { freopen("F://Temp/input.txt", "r", stdin); int s1, s2, n; scanf("%d%d%d", &s1, &s2, &n); int s, t; char c; for(int i = 0; i < 100002; i ++) { nodes[i] = 0; nodes_ans[i] = 0; } for(int i = 0; i < n; i ++) { scanf("%d %c %d", &s, &c, &t); nodes[s] = t; } int start = s1; int end; while(start != -1) { nodes_ans[start] = 1; start = nodes[start]; }//找到第一个链表的所有节点,并置为1 start = s2; bool flag = false; while(start != -1) { if(nodes_ans[start] != 0) { printf("%.5d\n", start); return 0; } else { nodes_ans[start] = nodes[start]; start = nodes[start]; } } puts("-1"); return 0; }
相关文章推荐
- 无敌小胖纸
- 互联网+
- 词向量( Distributed Representation)工作原理是什么
- 带有竖线|的String的 split()
- ListView的几种形式
- 【智能路由器】基于netfilter的高效广告植入(非代理方式)
- 【Educational Codeforces Round 2E】【STL-map 启发式合并 or 线段树动态开节点 】Lomsat gelral 一棵树每点一个颜色问每个节点子树的颜色众数之和
- 发扬光大的机智 注意long long acm2046骨牌铺地问题
- Amdahl定律
- 使用事务操作SQLite数据库
- Android sqlite3工具的使用
- 线程操作方法
- 浅析Java内存模型
- hdu2527 Safe Or Unsafe
- 学生管理系统
- IOS 关键字self,super,copy, retain, assign , readonly , readwrite, nonatomic、@synthesize、@property、@dynamic
- 打印1到最大的n位数。
- perl vim美化
- 杭电题002
- 老陈和小石头