九度1468 Sharing
2013-03-06 23:06
302 查看
//原题地址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.
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 Nextwhere 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.样例输入:
样例输出:
题目描述:
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.
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 Nextwhere 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 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 00001 00002 4 00001 a 10001 10001 s -1 00002 a 10002 10002 t -1
样例输出:
67890 -1
#include <cstdio> #include <cctype> #include <string.h> int buf[100001]; inline bool getint(int &x){ x = 0; int mute = 1; char c; while(!isdigit(c = getchar()) && c != '-') if(c == -1) return false; c == '-' ? mute = -1 : x = c - '0'; while(isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - '0'; x *= mute; return true; } int main(){ int s, e, n; int a, b, ts, te; while(getint(s) && getint(e) && getint(n)){ memset(buf, -1, sizeof(buf)); for(int i = 1; i <= n; i++){ getint(a); getchar(); getchar(); getint(buf[a]); } a = b = 1; ts = s; te = e; while(buf[ts] != -1){ a++; //第一个字符串长度 ts = buf[ts]; }; while(buf[te] != -1){ b++; //第二个字符串长度 te = buf[te]; }; if(ts != te) puts("-1"); else{ int len = a >= b ? a - b : b - a; if(a >= b){ ts = s; te = e; } else{ ts = e; te = s; } while(len--) ts = buf[ts]; while(ts != te){ ts = buf[ts]; te = buf[te]; } printf("%05d\n", ts); } } }
相关文章推荐
- 九度笔记之 1468:Sharing
- 九度OJ-题目1468-Sharing-链表
- 九度OJ 1468 Sharing -- 哈希
- 九度OJ 1468 Sharing -- 哈希
- 九度oj 题目1468:Sharing 【ZJU2012考研机试题2】
- 九度考研真题 浙大 2012-2浙大1468:Sharing
- 九度OnlineJudge之1468:Sharing
- 题目1468:Sharing
- 题目1468:Sharing
- 题目1468:Sharing
- 题目1468: Sharing
- 九度:1468<Sharing><链表>
- 九度OJ 题目1468:Sharing
- 九度OJ 1058:反序输出 (基础题)
- 九度OJ 1068:球的半径和体积 (基础题)
- 九度考研真题 浙大 2012-3浙大1437:To Fill or Not to Fill
- 九度OJ 1077:最大序列和 (DP)
- 九度OJ 1092:Fibonacci (递归)
- 九度王道考研机试真题 2011-3哈工 题目1052:找x 查找
- 九度OJ 1110:小白鼠排队 (排序)