zoukankan      html  css  js  c++  java
  • Pat 1052 Linked List Sorting (25)

    1052. Linked List Sorting (25)

    时间限制
    400 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    CHEN, Yue

    A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, you are supposed to sort the structures according to their key values in increasing order.

    Input Specification:

    Each input file contains one test case. For each case, the first line contains a positive N (< 105) and an address of the head node, where N is the total number of nodes in memory and the address of a node is a 5-digit positive integer. NULL is represented by -1.

    Then N lines follow, each describes a node in the format:

    Address Key Next

    where Address is the address of the node in memory, Key is an integer in [-105, 105], and Next is the address of the next node. It is guaranteed that all the keys are distinct and there is no cycle in the linked list starting from the head node.

    Output Specification:

    For each test case, the output format is the same as that of the input, where N is the total number of nodes in the list and all the nodes must be sorted order.

    Sample Input:
    5 00001
    11111 100 -1
    00001 0 22222
    33333 100000 11111
    12345 -1 33333
    22222 1000 12345
    
    Sample Output:
    5 12345
    12345 -1 00001
    00001 0 11111
    11111 100 22222
    22222 1000 33333
    

    33333 100000 -1

    巨坑,有链表是空的情况,还有点不再链表中,还有千万别用cin

    #include <iostream>
    #include <string.h>
    #include <algorithm>
    #include <stdio.h>
    #include <stdlib.h>
    #include <math.h>
    #include <string>
    #include <map>
    
    using namespace std;
    #define MAX 100000
    struct Node{
        char l[10],r[10];
        int key;
    }a[MAX+5],e[MAX+5];
    int cmp(Node a,Node b){
        return a.key<b.key;
    }
    int n;
    char b[10];
    map<string,string> m1;
    map<string,int> m2;
    int main()
    {
    	scanf("%d",&n);scanf("%s",b);
        m1.clear();m2.clear();
        for(int i=1;i<=n;i++){
    		scanf("%s%d%s",a[i].l,&a[i].key,a[i].r);
            m1[a[i].l]=a[i].r;m2[a[i].l]=i;
        }
    	string c=b;
        if(c=="-1"){
            cout<<0<<" "<<b<<endl;
            return 0;
        }
    	int cnt=0;
        while(c!="-1"){
          e[++cnt]=a[m2[c]];
    	  c=m1[c];
        }
        sort(e+1,e+cnt+1,cmp);
        cout<<cnt<<" "<<e[1].l<<endl;
        for(int i=1;i<=cnt-1;i++)
            cout<<e[i].l<<" "<<e[i].key<<" "<<e[i+1].l<<endl;
        cout<<e[cnt].l<<" "<<e[cnt].key<<" "<<"-1"<<endl;
        return 0;
    }


  • 相关阅读:
    16、springboot——错误处理原理+定制错误页面(1)
    15、springboot——CRUD-跳转到修改员工页面+员工修改和删除实现 ⑥
    14、springboot——CRUD-跳转到添加员工页面+员工添加实现⑤
    13、springboot——CRUD-thymeleaf公共页面元素抽取④
    12、springboot——CRUD登录和拦截③
    11、springboot——CRUD国际化②
    10、springboot——CRUD导入静态资源以及设置默认访问首页①
    9、springmvc的自动配置
    8、模板引擎thymeleaf(百里香叶)
    7、对静态资源映射的规则
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228682.html
Copyright © 2011-2022 走看看