PAT 1046 Sharing (25)(不同长度字符串交点)

原创 2016年08月29日 16:35:33

题目

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

解题思路

  • 1.长的那个减掉长的个数,然后在比较,找到地址相同了的即可。

代码

#include<iostream>
#include<cstdio>

using namespace std;
char value[99999];
int next1[99999];
int main(){
    int f,s,n;
    scanf("%d %d %d",&f,&s,&n);
    int where,to;char a;
    for (int i= 0; i < n; ++i) {
        scanf("%d %c %d",&where,&a,&to);
        value[where] = a;
        next1[where] = to;
    }
    int la = 0,lb = 0;
    int now = f;
    while (now != -1) {
        la++;
        now = next1[now];
    }
    now = s;
    while (now != -1) {
        lb++;
        now =next1[now];
    }
   // cout << la << lb;
    int nowa = f;
    int nowb =s;
    if (la>lb) {
        int d = la - lb;
        while (d--) {
            nowa = next1[nowa];
        }
    }else {
        int d = lb - la;
        while (d--) {
            nowb =next1[nowb];
        }
    }

    while (nowa !=nowb) {
        nowa = next1[nowa];
        nowb = next1[nowb];
    }
    if (nowa == -1) {
        printf("%d\n",-1);
    }else {
        printf("%05d\n",nowa);
    }
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

浙江大学PAT_甲级_1032. Sharing (25)

题目地址:点击打开链接 To store English words, one method is to use linked lists and store a word letter b...

【C++】PAT(advanced level)1032. Sharing (25)

1032. Sharing (25) 时间限制 100 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, ...

PAT 1003 Sharing (25)

题目描述 To store English words, one method is to use linked lists and store a word letter by letter. T...

PAT甲级真题及训练集(16)--1032. Sharing (25)

1032. Sharing (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B ...

PAT:1032. Sharing (25)

Sharing 2012年浙江大学计算机及软件工程研究生机试真题 To store English words, one method is to use linked lists and store...
  • ZJFCLH
  • ZJFCLH
  • 2014年03月18日 16:48
  • 739

PAT A 1032. Sharing (25)

题目 To store English words, one method is to use linked lists and store a word letter by letter.  To...

PAT_A 1032.Sharing(25)==未完待续

共享尾串
  • scylhy
  • scylhy
  • 2017年03月24日 12:50
  • 155

PAT 1032. Sharing (25)

1032. Sharing (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 C...

1071. Speech Patterns (25)【字符串操作】——PAT (Advanced Level) Practise

题目信息1071. Speech Patterns (25)时间限制300 ms 内存限制65536 kB 代码长度限制16000 BPeople often have a preference ...

1082. Read Number in Chinese (25)【字符串处理】——PAT (Advanced Level) Practise

题目信息1082. Read Number in Chinese (25)时间限制400 ms 内存限制65536 kB 代码长度限制16000 B Given an integer with ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:PAT 1046 Sharing (25)(不同长度字符串交点)
举报原因:
原因补充:

(最多只允许输入30个字)