1032. Sharing (25)
来源:互联网 发布:重庆 青少年编程 编辑:程序博客网 时间:2024/05/16 16:00
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}, andNext 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 <iostream>#include <stdio.h>using namespace std;struct Node{ char ch; int next;};Node arr[100001];int visited[100001];int ad1,ad2,N;int main(){ cin>>ad1>>ad2>>N; for(int i=0;i<N;i++){ int flag; cin>>flag; cin>>arr[flag].ch>>arr[flag].next; } int tmp = ad1; while(arr[tmp].next!=-1){ visited[tmp] = 1; tmp = arr[tmp].next; } visited[tmp] = 1; int temp; for(temp=ad2;temp!=-1&&!visited[temp];temp=arr[temp].next){ ; } if(temp!=-1) printf("%05d",temp); else printf("-1"); 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)
- DLL编写及注意点
- Python模块功能在实际应用方案中的相关功能的介绍
- protocol协议
- 卡片式电脑介绍
- USACO Section 3.2 Factorials
- 1032. Sharing (25)
- 在PE文件上添加执行代码
- java was started but returned exit code=1
- JAVA深复制(深克隆)与浅复制(浅克隆)
- Ubuntu 下的mysql中文乱码的解决
- UI组件:暴露最小限度接口,在组件基类中实装共性属性
- 黑马程序员__银行业务系统调度
- UI组件库不是固化的,而是开放性的(需要根据WebApp的独特需要做个性化修改)
- MD5 to String convert class