zoukankan      html  css  js  c++  java
  • 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}, and Nextis 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
    #include<cstdio>
    const int maxn = 100010;
    struct Node{
        int next;
        char data;
        bool flag;
    }node[maxn];
    
    
    int main(){
        int i;
        for(i = 0; i < maxn; i++){
            node[i].flag = false;
        }
        int address;
        int s1,s2,n;
        scanf("%d%d%d",&s1,&s2,&n);
        for( i = 0; i < n; i++){
            scanf("%d",&address);
            scanf(" %c %d",&node[address].data,&node[address].next);
        }
        int p;
      
        for(p = s1; p != -1; p = node[p].next){
            node[p].flag = true;
        }
        for(p = s2; p != -1; p = node[p].next){
            if(node[p].flag == true) break;
        }
        if(p == -1) printf("-1");
        else printf("%05d",p);
       
        return 0;
    }
  • 相关阅读:
    多帐套,多组织 登录系统设计
    Git常用命令速查05
    一步步搭建java信息管理系统00
    Git常用命令速查04
    Git常用命令速查03
    Git常用命令速查02
    Git常用命令速查01
    无法创建k/3中间层组件或组件正在调用中间层问题解决
    jQuery.i18n.properties实现前端国际化
    ORACLE telnet 1521 不通及ORA-12514: TNS: 监听程序当前无法识别连接描述符中请求的服务的解决
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/8550956.html
Copyright © 2011-2022 走看看