PAT 甲级 1032. Sharing (25)
来源:互联网 发布:ps 淘宝女装 编辑:程序博客网 时间:2024/04/28 18:30
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>#include <algorithm>#include <vector>using namespace std;struct NODE {char key;int next;bool flag;}node[100000];int main() {int s1, s2, n, a, b;scanf("%d%d%d", &s1, &s2, &n);char data;for (int i = 0; i < n; i++) {scanf("%d %c %d", &a, &data, &b);node[a].key = data;node[a].next = b;}for (int i = s1; i != -1; i = node[i].next) {node[i].flag = true;}for (int i = s2; i != -1; i = node[i].next) {if (node[i].flag == true) {printf("%05d", i);return 0;}}printf("-1");return 0;}
- 【PAT甲级】1032. Sharing (25)
- 1032. Sharing (25) PAT甲级
- PAT甲级1032. Sharing (25)
- PAT 甲级 1032. Sharing (25)
- 1032. Sharing (25)-PAT甲级真题
- PAT甲级练习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)
- scrapy初始第三波——CrawlSpider爬取拉勾招聘网
- [转]手把手教你使用Git
- C语言 通过指针,数组名 遍历一位数组
- hhh
- PYTHON机器学习实战——PCA主成分分析 数据降维
- PAT 甲级 1032. Sharing (25)
- 第三章习题5第3小题
- 计数排序
- BZOJ[1671][Usaco2005 Dec]Knights of Ni 骑士 Floodfill
- 为WebStorm设置SASS的File Watchers
- 数据分析利器之hive优化十大原则
- 多线程(一)--线程的创建,Thread类与Runnable接口
- 【二分+状压DP】Codeforces743E[Vladik and cards]题解
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem