zoukankan      html  css  js  c++  java
  • A1032. 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 9
    67890 i 00002
    00010 a 12345
    00003 g -1
    12345 D 67890
    00002 n 00003
    22222 B 23456
    11111 L 00001
    23456 e 67890
    00001 o 00010
    

    Sample Output 1:

    67890
    

    Sample Input 2:

    00001 00002 4
    00001 a 10001
    10001 s -1
    00002 a 10002
    10002 t -1
    

    Sample Output 2:

    -1
     1 #include <stdio.h>
     2 #include <stdlib.h>
     3 #include <iostream>
     4 #include <string.h>
     5 
     6 #include <math.h>
     7 #include <algorithm>
     8 #include <vector>
     9 #include <set> 
    10 #include <string>
    11 #include <map> 
    12 using namespace std;
    13 const int maxn=100010;
    14 struct Node{
    15     char data;
    16     int next;
    17     bool flag;
    18 }node[maxn];
    19 
    20  
    21 int main(){
    22    for(int i=0;i<maxn;i++)
    23    {
    24        node[i].flag=false;
    25    }
    26    int s1,s2,n;
    27    scanf("%d%d%d",&s1,&s2,&n);
    28    int address,next;
    29    char data;
    30    for(int i=0;i<n;i++)
    31    {
    32        scanf("%d %c %d",&address,&data,&next);
    33        node[address].data=data;
    34        node[address].next=next;
    35    }
    36    int p;
    37    for(p=s1;p!=-1;p=node[p].next)
    38    {
    39        node[p].flag=true;
    40    }
    41    for(p=s2;p!=-1;p=node[p].next)
    42    {
    43        if(node[p].flag==true)break;
    44    }
    45    if(p!=-1)
    46    {
    47        printf("%05d
    ",p);
    48    }else
    49    {
    50        printf("-1
    ");
    51    }
    52     return 0;
    53 }
  • 相关阅读:
    Notepad++ 中如何将代码格式化
    JAVA 解析复杂的json字符串
    8. java操作mongodb——查询数据
    7.第一次使用java连接mongodb遇到的问题
    13. Intellij IDEA调试功能使用总结
    HttpClient4.5简单使用
    12.Intellij IDEA 添加jar包的三种方式
    11.IntelliJ IDEA详细配置和使用教程(适用于Java开发人员)
    10.Intellij IDEA svn的使用详解
    黑客攻克索尼影业,掌控了操作系统的未来
  • 原文地址:https://www.cnblogs.com/ligen/p/4311791.html
Copyright © 2011-2022 走看看