PAT (Advanced Level) Practise 1032 Sharing (25)
来源:互联网 发布:尚硅谷大数据视频 编辑:程序博客网 时间:2024/06/03 08:20
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
题意:给你两个链表的头指针,给出n个节点,求出这两个链表第一个公共的区域
解题思路:枚举第一个链表,记录下哪些区域出现过,然后在去枚举第二个链表即可
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <cmath>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;struct node{int nt;char ch[5];}x[100009];int s, ss, n,vis[100009];int main(){while (~scanf("%d%d%d", &s, &ss, &n)){memset(x, -1, sizeof x);memset(vis, 0, sizeof vis);int id;for (int i = 0; i < n; i++){scanf("%d", &id);scanf("%s%d", x[id].ch, &x[id].nt);}for (int i = s; ~i; i = x[i].nt) vis[i] = 1;int ans = -1;for (int i = ss; ~i; i = x[i].nt)if (vis[i]) { ans = i; break; }if(ans!=-1) printf("%05d\n", ans);else printf("-1\n");}return 0;}
- PAT (Advanced Level) Practise 1032 Sharing (25)
- PAT (Advanced Level) Practise 1032. Sharing (25)
- 1032. Sharing (25)【链表】——PAT (Advanced Level) Practise
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1032(Sharing)
- 【PAT Advanced Level】1032. Sharing (25)
- 【C++】PAT(advanced level)1032. Sharing (25)
- PAT (Advanced Level) Practise1032 Sharing (25)
- 【PAT】【Advanced Level】1032. Sharing (25)
- Android架构设计之MVP分析
- git 的使用
- gym 100543 CERC 2014 L Outer space invaders
- 机器学习-学习笔记 支持向量机
- Spring 4.0 学习日记(1) --IOC 控制反转概念解释
- PAT (Advanced Level) Practise 1032 Sharing (25)
- 不要重新定义继承来的非虚函数
- PHP实现无限极分类的两种方式,递归和引用
- 周志华点评机器学习会议
- 关于leveldb源码整理之一
- PAT (Advanced Level) Practise 1033 To Fill or Not to Fill (25)
- SPOJ-QTREE4 Query on a tree IV(边分治)
- tip-2017-7-20
- 常见的web漏洞及其防范