1032. Sharing (25)
来源:互联网 发布:瞻博网络工厂 编辑:程序博客网 时间:2024/06/09 17:47
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<iostream>#include<cstdio>using namespace std;struct node{char c;int next;int vis;};struct node N[100000];int s1,s2;int n;int main(){ cin>>s1>>s2>>n; int a,c; char b; for (int i=0;i<n;i++) { scanf("%d %c %d",&a,&b,&c); N[a].next=c; N[a].vis=0; } while(s1!=-1) { N[s1].vis=1; s1=N[s1].next; } while(s2!=-1) { if(N[s2].vis==1) { printf("%05d",s2); return 0; } s2=N[s2].next; } cout<<"-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)
- android studio提示Error:Unable to tunnel through proxy. Proxy returns "HTTP/1.1 400 Bad Reques
- 关于数据库备份
- POJ 3083 Children of the Candy Corn 笔记
- java中数组的定义及其基础应用
- android仿微信消息长按根据触摸位置弹出对话框
- 1032. Sharing (25)
- AJAX基础
- 170718 python3.x install PIL
- Crazy Learning for Day 19
- 一次关于ETCD客户端(ETCD4J)问题的定位
- 一分钟了解“c语言printf函数”
- TCP-IP学习笔记(三)——概述
- C语言32个关键字(分类)
- 正则ES5-6