PAT-A-1032. Sharing (25)
来源:互联网 发布:国外游戏源码交易平台 编辑:程序博客网 时间:2024/05/16 08:34
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}, 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<cstdio>#include<stdio.h>using namespace std;const int maxn = 100010;struct Node{ char date; int next; int flag; Node() { flag = 0; }}node[maxn];int main(){ int s1, s2, n; cin >> s1 >> s2 >> n; int addr; for (int i = 0; i < n; i++) { cin >> addr; cin >> node[addr].date >> node[addr].next; } int p; for (p = s1; p != -1; p = node[p].next) node[p].flag = 1; for (p = s2; p != -1; p = node[p].next) { if (node[p].flag == 1) break; } if (p != -1) printf("%05d\n", p); else cout << "-1" << endl; system("pause"); return 0;}
- PAT A 1032. Sharing (25)
- PAT(A) - 1032. Sharing (25)
- PAT-A-1032. Sharing (25)
- 1032. Sharing (25)-PAT
- 【PAT】1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT:1032. Sharing (25)
- PAT 1032. Sharing (25)
- pat 1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT 1032. Sharing (25)
- 1032. Sharing (25) PAT
- pat a 1032 sharing
- PAT (Advanced) 1032. Sharing (25)
- 写在项目的尾巴
- Android Studio恢复移除的Module
- 将两个升序排列的链表合并后升序排序打印.
- 《算法导论(原书第3版)》pdf
- fastjson范型解析的时候报无法解析内部类的错误create instance error, class com.example.kodulf.utilsdemo.entity.City$Flow
- PAT-A-1032. Sharing (25)
- Tensorflow自我训练进阶(代码+注解)【2】第一个神经网络--简单感知器处理MNIST
- Linux下FFMPEG 简单的Demo开发
- 计算机系统知识汇总
- 无向图的割顶和桥
- python网络爬虫(1)--抓取图片(2)
- IDEA下搭建maven实例项目
- redis主从复制
- Python购物车系统模拟1