PAT(Advanced Level)1098. Insertion or Heap Sort

1098. Insertion or Heap Sort (25)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

According to Wikipedia:

Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.

Heap sort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. it involves the use of a heap data structure rather than a linear-time search to find the maximum.

Now given the initial sequence of integers, together with a sequence which is a result of several iterations of some sorting method, can you tell which sorting method we are using?

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (<=100). Then in the next line, N integers are given as the initial sequence. The last line contains the partially sorted sequence of the N numbers. It is assumed that the target sequence is always ascending. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in the first line either "Insertion Sort" or "Heap Sort" to indicate the method used to obtain the partial result. Then run this method for one more iteration and output in the second line the resuling sequence. It is guaranteed that the answer is unique for each test case. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.

Sample Input 1:

103 1 2 8 7 5 9 4 6 01 2 3 7 8 5 9 4 6 0

Sample Output 1:

Insertion Sort1 2 3 5 7 8 9 4 6 0

Sample Input 2:

103 1 2 8 7 5 9 4 6 06 4 5 1 0 3 2 7 8 9

Sample Output 2:

Heap Sort5 4 3 1 0 2 6 7 8 9

       给你两个数组，让你判断是堆排序还是插入排序，并给出下一步排序后的结果。插入排序判断方式很简单，遍历第二个数组，当后者小于前者时退出循环，然后再从此处开始与第一个数组向后比较，如果不相等是堆排序，如果相等是插入排序，因为插入排序尾部部分与原数组保持一致。如果是堆排序，则进行一次pushdown操作就可以了。

#include <iostream>#include <algorithm>using namespace std;int n,a[101],num[101];void heapsort();void insertionsort(int d);int main(){    int j;    cin>>n;    for(int i = 0;i < n;cin>>a[i++]);    for(int i = 0;i < n;cin>>num[i++]);    for(j = 1;j < n-1;j++){        if(num[j]<num[j-1])            break;    }    int f = 0;    for(int i = j;i < n;i++){        if(num[i]!=a[i]){            f = 1;            break;        }    }    if(f){        cout<<"Heap Sort"<<endl;        heapsort();    }    else {        cout<<"Insertion Sort"<<endl;        insertionsort(j);    }    return 0;}void heapsort(){  int i;  sort(a,a+n);  for(i = n-1;i >= 0;i--)        if(a[i]!=num[i])break;  swap(num[0],num[i]);  int temp,j = 0,k;  for(temp = num[0];2*j+1<i;j=k){    k = 2*j+1;    if(k!=i-1&&num[k+1]>num[k])        k++;    if(temp<num[k])        num[j] = num[k];    else break;  }  num[j] = temp;  for(i = 0;i < n;i++){    cout<<num[i];    if(i!=n-1)        cout<<' ';  }  return;}void insertionsort(int d){  sort(num,num+d+1);  for(int i = 0;i < n;i++){    cout<<num[i];    if(i!=n-1)        cout<<" ";  }  return;}