PAT甲级 1098 插入排序，堆排序

1098 Insertion or Heap Sort

分数：25

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 resulting 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:

10
3 1 2 8 7 5 9 4 6 0
1 2 3 7 8 5 9 4 6 0

Sample Output 1:

Insertion Sort
1 2 3 5 7 8 9 4 6 0

Sample Input 2:

10
3 1 2 8 7 5 9 4 6 0
6 4 5 1 0 3 2 7 8 9

Sample Output 2:

Heap Sort
5 4 3 1 0 2 6 7 8 9

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

题意：

给你插入排序和归并排序的排序过的一部分，你识别这是插入排序还是归并并且输出下一步

小坑：

对应插入排序，可能会有连续几步排序的结果是一样的，取最后一次排序结果走下一步噢~

解法：模拟排序过程每一次就与这一部分进行比较就可以了

如果看不懂代码可以看我的另一篇文章中的堆排序的实现：堆排序，快速排序，归并排序c++实现(附逻辑教程链接)-CSDN博客

代码实现：

#include<bits/stdc++.h>
using namespace std;
int n;
int a[100],b[100];
int work[100];

void swap(int& a,int& b){
    int temp = b;
    b = a;
    a = temp;
}

void insertion(int k){
    for(int i=0;i<n;i++) work[i] = a[i];
    sort(work,work+k);
}

bool issame(){
    for(int i=0;i<n;i++) if(b[i]!=work[i]) return false;
    return true;
}

void heapfiy(int i){
    while(2*i+1<=n-1){
        int large = i;
        int l = 2*i+1,r = 2*i+2;
        if(l<=n-1&&work[l]>work[large]) large = l;
        if(r<=n-1&&work[r]>work[large]) large = r;
        if(i!=large){
            swap(work[i],work[large]);
            i = large;
        }else break;
    }
}

void buildheap(){
    for(int i=0;i<n;i++) work[i] = a[i];
    for(int i=(n-1-1)/2;i>=0;i--) heapfiy(i);
}

int main(){
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i];
    for(int i=0;i<n;i++) cin>>b[i];

    //判断是不是插入排序    
    for(int i=n-1;i>0;i--){
        insertion(i);
        if(issame()){
            insertion(i+1);
            cout<<"Insertion Sort"<<endl;
            for(int j=0;j<n;j++){
                if(!j) cout<<work[j];
                else cout<<" "<<work[j];
            }
            return 0;
        }
    }

//因为肯定有解那肯定是堆排序 
    int m = n;
    buildheap();
    if(issame()){
            swap(work[0],work[n-1]);
            n--;
            heapfiy(0);
            cout<<"Heap Sort"<<endl;
            for(int j=0;j<m;j++){
                if(!j) cout<<work[j];
                else cout<<" "<<work[j];
            }
        return 0;
    }
    
    for(int i=0;i<n;i++){
        swap(work[0],work[n-1]);
        n--;
        heapfiy(0);
        
        if(issame()){
            swap(work[0],work[n-1]);
            n--;
            heapfiy(0);
            cout<<"Heap Sort"<<endl;
            for(int j=0;j<m;j++){
                if(!j) cout<<work[j];
                else cout<<" "<<work[j];
            }
        return 0;
        }
    }
}