PAT 1032. Sharing (25)
来源:互联网 发布:淘宝星期几流量最少 编辑:程序博客网 时间:2024/04/28 17:01
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
/* * 挺简单的一题。。判断一个地址有没有出现2次即可~ */#include "iostream"#include "string"using namespace std;struct Node {char c;int next;bool flag = 0;}node[100000];int main() {int startI, startJ, n;cin >> startI >> startJ >> n;for (int i = 0; i < n; i++) {int a, c;char b;scanf("%d %c %d", &a, &b, &c);node[a].c = b;node[a].next = c;}while (startI != -1) {node[startI].flag = 1;startI = node[startI].next;}while (startJ != -1) {if (node[startJ].flag) {printf("%05d\n", startJ);return 0; }startJ = node[startJ].next;}printf("-1\n");return 0;}
- 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 (Advanced) 1032. Sharing (25)
- PAT A 1032. Sharing (25)
- PAT甲 1032. Sharing (25)
- PAT(A) - 1032. Sharing (25)
- 【PAT甲级】1032. Sharing (25)
- (JVM1)Java内存区域与内存溢出异常
- jzoj 5020. 【NOI2017模拟3.17】牛奶装瓶 线段树
- InnoDB存储引擎文件
- HTTP协议详解
- 使用库函数API和C代码中嵌入汇编代码两种方式使用同一个系统调用
- PAT 1032. Sharing (25)
- 设计模式:组合模式(COMPOSITE)|菜鸟教程
- Java设计模式之模板(template)方法模式
- 前端开发中常用的console
- JVM【一】
- matlab 与 Java 运算速度
- 字符串字符统计
- 蓝桥杯—平方怪圈 算法分析
- 将jar安装到本地仓库