1032. Sharing (25)
来源:互联网 发布:aoc和三星 知乎 编辑:程序博客网 时间:2024/05/17 04:58
1032. 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.
Sample Input 1:11111 22222 967890 i 0000200010 a 1234500003 g -112345 D 6789000002 n 0000322222 B 2345611111 L 0000123456 e 6789000001 o 00010Sample Output 1:
67890Sample Input 2:
00001 00002 400001 a 1000110001 s -100002 a 1000210002 t -1Sample Output 2:
-1
#include <stdio.h>#include <stdlib.h>#include <memory.h>#define MAX 100000int main(){int map[MAX];int visited[MAX];int start1,start2,i,N,address,next;char s[2];memset(visited,0,sizeof visited);//freopen("d:\\input.txt","r",stdin);scanf("%d%d%d",&start1,&start2,&N);for(i=0;i<N;i++){scanf("%d%s%d",&address,s,&next);map[address] = next;}while(start1!= -1){visited[start1] = 1;start1 = map[start1];}while(start2 != -1 && visited[start2] != 1){start2 = map[start2];}if(start2 == -1){printf("-1\n");}else{printf("%05d\n",start2);}return 0;}
- 1032. Sharing (25)
- 1032. Sharing (25)-PAT
- 【PAT】1032. Sharing (25)
- 1032. Sharing (25)
- 1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT:1032. Sharing (25)
- 1032. Sharing (25)
- PAT 1032. Sharing (25)
- 1032. Sharing (25)
- 1032. Sharing (25)
- 1032. Sharing (25)
- 1032. Sharing (25)
- 1032. Sharing (25)
- 1032. Sharing (25)
- pat 1032. Sharing (25)
- JavaScript面向对象编程之继承
- 二叉树最近公共祖先
- Instanceof和isInstance的区别
- hdu 5900 QSC and Master (区间dp)
- Java之类注意事项
- 1032. Sharing (25)
- Java 实现 Base64 加密解密
- 判断输入框是否全为空格
- 关于shell
- Jenkins+Maven+Git+Tomcat快速搭建持续集成环境
- web性能测试
- oracle 双竖线 ||
- 会抖动的导航栏
- 二叉树相关问题编程实现(1)