07-2. Insert or Merge (25)

07-2. Insert or Merge (25) time limit MS
Memory Limit 65536 KB
Code length limit 8000 B
Procedures for the award of questions StandardAuthor Chen, Yue

According to Wikipedia:

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

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

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

Input Specification:

Each input file contains the one test case. For each case, the first line gives a positive integer N (<=100). Then on the next line, N integers is given as the initial sequence. The last line contains the partially sorted sequence of the N numbers. It is assumed, the target sequence is always ascending. All the numbers in a line is 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, the answer is unique for each test case. All the numbers in a line must is separated by a space, and there must is 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 0 61 3 2 8 5 7 4 9 0 6

Sample Output 2:

Merge Sort1 2 3 8 4 5 7 9 0 6

Submit Code

#include <iostream> #include <algorithm> #include <string> #include <cstdio> #include < cstring> #include <cstdlib> #include <cmath> #include <vector> #include <queue> #include < stack> #include <map> #include <set>using namespace std; #define Lson Rt<<1,l,mid#define Rson rt< <1|1,mid+1,r//#define Lson root<<1//#define Rson root<<1|1#define MID ((l+r) >>1) typedef long LONG Ll;typedef pair<int,int> p;const int maxn=105;const int base=1000;const int Inf=999999;const double Eps=1e-5;int a[ Maxn];int aa[maxn];int b[maxn];int n;bool Same (int *a,int *b)//judge the same not {for (int i=1; i<=n; i++) {if (a[i]!=b    [i]) return false; } return true;    BOOL Insert_sort ()//true insertion of the sort {int i,j;    int last=0;        for (i=2; i<=n; i++)///start from i=2 or the second test point is wrong {a[0]=a[i];        for (j=i-1; a[j]>a[0]; j--) {a[j+1]=a[j];        } A[j+1]=a[0];        if (last){return true;        } if (Same (a, b)) {last=1; }} return false;}    void Merge_sort ()//simulate merge sort {int last=0,i,j;        for (i=2;i<=n;i*=2) {for (j=1;j+i<=n+1;j+=i) {sort (aa+j,aa+j+i);        } sort (aa+j,aa+n+1);        if (last) return;    if (Same (aa,b)) last=1; } sort (aa+1,aa+n+1);}    int main () {int m,i,j,k,t;    scanf ("%d", &n);        for (I=1; i<=n; i++) {scanf ("%d", &a[i]);    Aa[i]=a[i];    } for (I=1; i<=n; i++) {scanf ("%d", &b[i]);        } if (Insert_sort ()) {puts ("insertion sort");        printf ("%d", a[1]);        for (i=2; i<=n; i++) printf ("%d", a[i]);    printf ("\ n");        } else {puts ("Merge Sort");        Merge_sort ();        printf ("%d", aa[1]);        for (i=2; i<=n; i++) printf ("%d", aa[i]);    printf ("\ n"); } return 0;} /*103 1 2 8 7 5 9 4 0 61 2 3 4 5 7 8 9 0 6*/

07-2. Insert or Merge (25)