PAT-1032
来源:互联网 发布:淘宝产品编辑模板 编辑:程序博客网 时间:2024/05/20 10:12
1032. Sharing (25)
题目地址:http://pat.zju.edu.cn/contests/pat-practise/1032
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 00010
Sample Output 1:
67890
Sample Input 2:
00001 00002 400001 a 1000110001 s -100002 a 1000210002 t -1
Sample Output 2:
-1
#if 1#include <iostream>#include <cstdio>#include <cstring>using namespace std;struct node{ int index; char c; char flag; int next;};typedef struct node Node;static const int N = 1000060;static Node list[N];int main(int argc,char *argv[]){ int a,b; int n; int index,next; char c; int CommonIndex; freopen( "D:\\Chengsq\\in.txt" , "r" ,stdin); freopen( "D:\\Chengsq\\out.txt", "w" ,stdout); while(cin>>a>>b>>n) { memset(list,0, sizeof(Node)*N); for( int i = 0;i < n;i++) { cin>>index>>c>>next; list[index].index = index; list[index].c = c; list[index].next = next; } CommonIndex = -1; int j; j = a; while(j != -1) { (list[j].flag)++; j = list[j].next; } j = b; while(j != -1) { list[j].flag++; if(list[j].flag == 2) { CommonIndex = j; break; } j = list[j].next; } if(CommonIndex == -1) cout<<CommonIndex<<endl; else printf( "%.05d\n",CommonIndex); } return 0;}#endif
- PAT-1032
- pat 1032
- PAT 1032
- PAT 1032
- pat 1032 Sharing
- pat advanced 1032
- PAT(甲级)1032
- 浙大PAT甲级 1032
- PAT乙级1032
- pat-bl-1032
- PAT甲级1032
- PAT 1032 Sharing
- pat乙级1032
- 浙大PAT甲级-1032
- PAT甲级 1032
- PAT basic 1032
- PAT 乙级 1032
- pat a 1032 sharing
- notepad++默认的快捷键整理
- 友元
- JVM的内存溢出异常
- Web权限验证过滤器
- JDBCTemplate在hsqldb数据库中的应用
- PAT-1032
- 将字符串切割成数组 componentsSeparatedByString
- 获取所有本机IP地址
- catalina.home和catalina.base
- notepad++ 中列操作
- Android Notification通知详解
- 编程中无穷大常量的设定技巧
- JAVA的OPENGL,JOGL入门例子----不断变色的点阵(2D)
- 利用Dat保存读取地图的思路小议