A1032. Sharing (25)

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.

时间限制
100 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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

思路：判断两个链表后缀是否相等，先把所有链表的bool置0，再找出第一个链表，遍历，bool置1，遍历第二个链表，若发现bool为1则为公共节点，从此遍历到结尾即为suffix(后缀)，若不存在返回-1。

注意：头文件引用两边会运行超时！！！我手残傻逼了检查代码好久，编译器不报错好气啊！
* 输出格式，%05d
* scanf时，%c两边需要空格，%d %c %c
* %d不需要，可以直接%d%d%d

代码

#include<cstdio>
#include<cstring>
const int maxn=100010;
struct NODE{
    char data;
    int next;
    bool flag;
}node[maxn];
int main()
{   int i;
    for( i=0;i<maxn;i++)
    {
        node[i].flag=false;
    }
    int s1,s2,n;
    scanf("%d%d%d",&s1,&s2,&n);
    int address,next;
    char data;
    for( i=0;i<n;i++)
    {
        scanf("%d %c %d",&address,&data,&next);
        node[address].data=data;
        node[address].next=next;
    }
    int p;
    for(p=s1;p!=-1;p=node[p].next)
    {
        node[p].flag=true;
    }
    for(p=s2;p!=-1;p=node[p].next)
    if(node[p].flag==1)break;
        if(p!=-1)printf("%05d\n",p);
        else printf("-1\n");
        return 0;
}