PAT.A1089. Insert or Merge

原创 2018年04月16日 20:11: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.

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

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <iostream>
using namespace std;
int n, ori[110], changed[110],tmp[110];
bool issame(int a1[], int a2[]) {
	for (int i = 0; i < n; i++) {
		if (a1[i] != a2[i]) return false;
	}
	return true;
}
bool inserso() {
	int f = 0;
	for (int i = 1; i < n; i++) {
		int j = i, k = ori[i];
		while (j > 0 && ori[j-1] > k) {
			ori[j] = ori[j - 1];
			j--;
		}
		ori[j] = k;
		if (f == 1) return true;
		if (issame(ori, changed)) 
			f = 1;
	}
	return false;
}
void mergeso(int a[]) {
	bool f = false;
	for (int step = 2; step / 2 <=n; step *= 2) {
		for (int i = 0; i <n; i += step)
			sort(a + i, a + min(i + step, n ));
		if (f) {
			for (int i = 0; i < n; i++) {
				printf("%d", a[i]);
				if (i < n - 1) printf(" ");
			}
			return;
		}
		if (issame(a, changed)) f = true;
	}
}
int main(){
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &ori[i]);
		tmp[i] = ori[i];
	}
		
	for (int i = 0; i < n; i++)
		scanf("%d", &changed[i]);
	if (inserso()) {
		printf("Insertion Sort\n");
		for (int i = 0; i < n; i++) {
			printf("%d", ori[i]);
			if (i < n - 1) printf(" ");
		}
	}
	else {
		printf("Merge Sort\n");
		mergeso(tmp);
	}
	return 0;
	
}

赵强老师:Oracle数据库从10g到11g(3)DML语句和DDL语句

学习并掌握DML语句:insert、update和delete语句;并能够使用DDL管理常见的数据库对象:表、视图、序列、索引和同义词。
  • 2018年04月05日 06:51

Merge Into 语句代替Insert/Update在Oracle中的应用实战

动机:想在Oracle中用一条SQL语句直接进行Insert/Update的操作。说明:在进行SQL语句编写时,我们经常会遇到大量的同时进行Insert/Update的语句 ,也就是说当存在记录时,就...
  • yuzhic
  • yuzhic
  • 2007-11-21 19:01:00
  • 52129

Merge Into 语句代替Insert/Update

动机: 想在Oracle中用一条SQL语句直接进行Insert/Update的操作。 说明: 在进行SQL语句编写时,我们经常会遇到大量的同时进行Insert/Update的语句 ,也就是说当存...
  • xwnxwn
  • xwnxwn
  • 2016-08-08 21:13:31
  • 2182

MERGE 比 DELETE INSERT 更新 可靠多了

MERGE 比  DELETE INSERT 慢很多! 可 DELETE INSERT 总是 发生违反唯一关键子,删除了无法再插进去。还有时不时的丢失数据。 MERGE 可以减少数据量来提高运行速度,...
  • ZengMuAnSha
  • ZengMuAnSha
  • 2010-05-13 14:04:00
  • 1245

sql server merge 做insert和update

CREATE TABLE test1 (id INT, f1 VARCHAR(10),f2 VARCHAR(10),f3 VARCHAR(10)) GO INSERT INTO test1 SELEC...
  • wangzhpwang
  • wangzhpwang
  • 2016-12-21 17:53:08
  • 2017

07-2. Insert or Merge (25)

07-2. Insert or Merge (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard ...
  • u013167299
  • u013167299
  • 2015-01-12 13:59:55
  • 862

【PAT】1089. Insert or Merge (25)

According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and g...
  • realxuejin
  • realxuejin
  • 2015-10-22 16:13:57
  • 594

Oracle SQL:insert into语句总结 与 merge into用法总结

insert into语句总结 vs merge into用法总结:1、insert into 插入数据;2、merge into 有则更新,无则插入;...
  • yihuiworld
  • yihuiworld
  • 2015-03-27 16:33:36
  • 20863

SQL Server的Merge —— 一步实现 insert,update,delete

USE tempdb GO IF OBJECT_ID('SourceTable') IS NOT NULL DROP TABLE SourceTable IF OBJECT_ID('TargetTab...
  • yenange
  • yenange
  • 2016-09-29 16:46:45
  • 1501

DB2 insert or update 解决方案(使用merge into 解决一条记录,或者多表关系问题)

DB2 insert or update 解决方案(使用merge into 解决一条记录,或者多表关系问题)...
  • harrison2010
  • harrison2010
  • 2011-05-20 15:01:00
  • 3127
收藏助手
不良信息举报
您举报文章:PAT.A1089. Insert or Merge
举报原因:
原因补充:

(最多只允许输入30个字)