九度1468 Sharing

//原题地址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 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

#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
	  	   
九度：1468<Sharing><链表>
	  	   
九度OnlineJudge之1468：Sharing
	  	   
九度笔记之 1468：Sharing
	  	   
九度OJ 1468 Sharing -- 哈希
	  	   
九度OJ 题目1468：Sharing
	  	   
九度OJ-题目1468-Sharing-链表
	  	   
九度oj 题目1468：Sharing 【ZJU2012考研机试题2】
	  	   
九度考研真题 浙大 2012-2浙大1468：Sharing
	  	   
九度OJ 1145：Candy Sharing Game（分享蜡烛游戏） （模拟）
	  	   
题目1468：Sharing
	  	   
题目1468：Sharing
	  	   
题目1468：Sharing
	  	   
sharing
	  	   
Sharing
	  	   
Sharing
	  	   
Sharing
	  	   
九度1468
	     		  
	  	   
javascript(获取或设置html元素的宽,高,坐标)
	  	   
优化与求解非线性方程组（单变量问题）
	  	   
Oracle创建表、约束、视图、索引、序列、同义词、表空间
	  	   
hdu 1002 A + B Problem II
	  	   
中国知网的“学术不端检测”
	  	   
九度1468 Sharing
	  	   
memcpy惹的祸
	  	   
[转]在Ubuntu12.04上使用hostapd和dhcp3
	  	   
Ubuntu 12.04 the system is running in low-graphics mode
	  	   
C++关键字mutable
	  	   
SQLNET.AUTHENTICATION_SERVICES
	  	   
基于LRU算法的缓存实现
	  	   
Ext动态树详解
	  	   
PHP 数组和字符串互相转换