1089. Insert or Merge (25)

1089. Insert or Merge (25)

时间限制

200 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.

Merge sort works as follows: Divide the unsorted list into N sublists, each containing 1 element (a list of 1 element is considered sorted). Then repeatedly merge two adjacent sublists to produce new sorted sublists until there is only 1 sublist remaining.

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 "Merge 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 0 6
1 3 2 8 5 7 4 9 0 6

Sample Output 2:

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

给定2个序列，一个是原始序列，一个是经过插入排序或归并排序之后的序列。判断并输出某个排序算法下一步之后的序列。

柿子挑软的捏。插入排序前面几个是有序的，从不满足有序的数字开始，和原序列比较，如果后面全部相同，则为插入排序，否则是归并排序。

因为至少经过一次排序，如果是归并排序，那么每2个数字一定有序，考虑每4个(8,16,32...)是否有序。

技巧是比较第2个和第3个是否有序，比较2+2*2和2+2*2+1,比较2+2*2+2*2和2+2*2+2*2+1....，,如果，不有序则下一步归并中应该是每4个有序

    比较第4个和第5个是否有序，比较4+4*2和4+4*2+1,比较4+4*2+4*2和4+4*2+4*2+1....，

            ...

            直到不有序为止，得到下一步排序每多少个有序。用qsort排序。注意如果末尾有剩余，也要排序

#include<stdio.h>
#include<stdlib.h>
int comp(const void*a,const void*b){
return *(int*)a-*(int*)b;
}
int main(){
	int n,i,j;
	scanf("%d",&n);
	int a[n],b[n];
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	for(i=0;i<n;i++){
		scanf("%d",&b[i]);
	}
	int index;
	for(i=0;i<n-1;i++){
		if(b[i]>b[i+1]){
			index=i+1;break;
		}
	}
	int flag=1;
	for(i=index;i<n;i++){
		if(a[i]!=b[i]){
			flag=0;break;
		}
	}
	if(flag){
		int temp=b[index];
		for(j=index;j>0&&b[j-1]>temp;j--){
			b[j]=b[j-1];
		}
		b[j]=temp;
		printf("Insertion Sort\n");
		printf("%d",b[0]);
		for(i=1;i<n;i++){
			printf(" %d",b[i]);
		}		
	}
	else{
		flag=1;
		for(i=2;;i=i*2){
			for(j=i-1;j+1<n;j=j+i*2){
				if(b[j]>b[j+1]){
					flag=0;break;
				}
			}
			if(flag==0){
				i=i*2;break;	
			}
		}
		int distance=i;//每distance个数应该有序
		int count=n;
		for(i=0;i+distance<=n;i=i+distance){
			qsort(a+i,distance,sizeof(int),comp);
			count=count-distance;
		}
		if(count){
			qsort(a+i,count,sizeof(int),comp);//末尾还没有排序 
		}
		printf("Merge Sort\n");
		printf("%d",a[0]);
		for(i=1;i<n;i++){
			printf("% d",a[i]);
		}		
	}	
}