1089 Insert or Merge
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 (≤). 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 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:
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
题意:
给出一个序列的初始状态以及排序过程中的一种状态,判断属于那种排序方式。
思路:
刚开始是根据mooc上面老师讲的思路来做的,先判断是不是插入排序,若不是插入排序,则是归并排序。归并排序本来是想的找出当前归并段的长度(len),下次排序直接将相邻的两个len归并成一个。但是提交的时候发现有测试点过不去。于是就选择了模拟的办法,sort两个归并段。
Code:
#include<iostream>
#include<vector>
#include<algorithm> using namespace std; void Merge(vector<int> &p, vector<int> &t, int l, int r, int Rend) {
int Lend = r - 1;
int prt = l;
while (l <= Lend && r <= Rend) {
if (p[l] < p[r]) t[prt++] = p[l++];
if (p[r] < p[l]) t[prt++] = p[r++];
}
while (l <= Lend) t[prt++] = p[l++];
while (r <= Rend) t[prt++] = p[r++];
int len = 2 * (Rend - Lend);
for (int i = 0; i < len; ++i, Rend--) p[Rend] = t[Rend];
} int main() {
int n;
cin >> n; vector<int> init(n);
vector<int> part(n);
vector<int> temp(n); int t, p, q;
for (int i = 0; i < n; ++i) {
cin >> t;
init[i] = t;
}
for (int i = 0; i < n; ++i) {
cin >> t;
part[i] = t;
}
p = 1;
while (p < n && part[p] > part[p-1]) ++p;
p++;
q = p;
while (q < n && part[q] == init[q]) ++q; if (q == n) {
cout << "Insertion Sort" << endl;
sort(part.begin(), part.begin()+p);
cout << part[0];
for (int i = 1; i < n; ++i) cout << " " << part[i];
} else {
cout << "Merge Sort" << endl;
int j, k;
bool flag = false;
for (j = 1; j < n; j *= 2) {
k = j - 1;
while (k + 1 < n) {
if (part[k] < part[k+1]) k += 2 * j;
else { flag = true; break; }
}
if (flag) break;
}
for (k = 0; k <= n-2*j; k += 2*j) {
Merge(part, temp, k, k+j, k+2*j-1);
}
if (k + j < n)
Merge(part, temp, k, k+j, n); cout << part[0];
for (int i = 1; i < n; ++i) cout << " " << part[i];
} cout << endl; return 0;
}
骗了15分。
#include<iostream>
#include<vector>
#include<algorithm> using namespace std; int main() {
int n;
cin >> n; vector<int> init(n);
vector<int> part(n);
vector<int> temp(n); int t, p, q;
for (int i = 0; i < n; ++i) {
cin >> t;
init[i] = t;
}
for (int i = 0; i < n; ++i) {
cin >> t;
part[i] = t;
}
for (p = 0; p < n-1 && part[p] <= part[p+1]; p++);
for (q = p+1; init[q] == part[q] && q < n; q++);
if (q == n) {
cout << "Insertion Sort" << endl;
sort(part.begin(), part.begin()+p+2);
cout << part[0];
for (int i = 1; i < n; ++i) cout << " " << part[i];
} else {
cout << "Merge Sort" << endl;
int j, k = 1;
bool flag = true;
while (flag) {
flag = false;
for (int i = 0; i < n; ++i) {
if (init[i] != part[i])
flag = true;
}
k *= 2;
for (j = 0; j < n/k; ++j)
sort(init.begin()+j*k, init.begin()+(j+1)*k);
sort(init.begin()+(n/k)*k, init.end());
}
cout << init[0];
for (int i = 1; i < n; ++i)
cout << " " << init[i];
} cout << endl; return 0;
}
参考:
https://www.liuchuo.net/archives/1902
1089 Insert or Merge的更多相关文章
- PAT甲级1089. Insert or Merge
PAT甲级1089. Insert or Merge 题意: 根据维基百科: 插入排序迭代,消耗一个输入元素每次重复,并增加排序的输出列表.每次迭代,插入排序从输入数据中删除一个元素,在排序列表中找到 ...
- PAT 1089 Insert or Merge[难]
1089 Insert or Merge (25 分) According to Wikipedia: Insertion sort iterates, consuming one input ele ...
- PAT甲级:1089 Insert or Merge (25分)
PAT甲级:1089 Insert or Merge (25分) 题干 According to Wikipedia: Insertion sort iterates, consuming one i ...
- 1089 Insert or Merge(25 分)
According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and gr ...
- PAT 1089. Insert or Merge (25)
According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and gr ...
- 1089. Insert or Merge (25)
题目如下: According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, ...
- 1089. Insert or Merge (25)-判断插入排序还是归并排序
判断插入排序很好判断,不是的话那就是归并排序了. 由于归并排序区间是2.4.8开始递增的,所以要判断给出的归并排序执行到哪一步,就要k从2开始枚举. 然后再对每个子区间进行一下sort即可. #inc ...
- PAT (Advanced Level) 1089. Insert or Merge (25)
简单题.模拟一下即可. #include<cstdio> #include<cstring> #include<cmath> #include<vector& ...
- PAT 1089. Insert or Merge
Insertion sort iterates, consuming one input element each repetition, and growing a sorted output li ...
- 1089 Insert or Merge (25 分)
According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and gr ...
随机推荐
- 力扣496. 下一个更大元素 I
原题 1 class Solution: 2 def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[i ...
- 不用代码趣讲 ZooKeeper 集群
本文作者:HelloGitHub-老荀 Hi,这里是 HelloGitHub 推出的 HelloZooKeeper 系列,免费开源.有趣.入门级的 ZooKeeper 教程,面向有编程基础的新手. 项 ...
- 该死的端口占用!教你用 Shell 脚本一键干掉它!
1. 前言 大家好,我是安果! 在 Web 开发中,经常会遇到「端口被占用」的场景 常规解决方案是: 使用 lsof -i 命令查询占用端口的进程 PID 利用 kill -9 PID 干掉目标进程 ...
- FreeBSD 入门 哲学与玄学
『哲学与玄学』 FreeBSD 是一种 UNIX 哲学(如模块化,一切皆文件等,见< UNIX 编程艺术>❩的发展,也是学院派的代表作品.她是一套工具集,她存在目的是为了让人们更好的生活. ...
- vue 页面生成图片保存
需求:将页面中的元素转成图片,支持保存或下载.要求下载的图片包含页面背景,头像,用户名,文本为"我的邀请码"和个人二维码. 实现:将页面绘制到canvas中,生成base64图片链 ...
- Linux 自定义快捷命令
Linux中一些比较常用的命令总是重复敲很麻烦,这个时候就可以使用 alias 来自定义快捷命令,用以简化操作.系统会有一些预定义的快捷命令,比如 ll 的效果就和 ls -l 一样. 可以使用 al ...
- 2018ICPC 南京Problem J. Prime Game
题目: 题意:给出一个序列a1,⋯,ana1,⋯,an.fac(l,r)fac(l,r)为mul(l,r)mul(l,r)中不同质因数的个数. 请计算: ∑i=1n∑j ...
- P2089_烤鸡(JAVA语言)
题目背景 猪猪hanke得到了一只鸡 题目描述 猪猪Hanke特别喜欢吃烤鸡(本是同畜牲,相煎何太急!)Hanke吃鸡很特别,为什么特别呢?因为他有10种配料(芥末.孜然等),每种配料可以放1-3克, ...
- 操作系统实验(一)-Shell编程
操作系统实验:Shell编程 emmmmm,实验前老师发了一份实验说明,里面有教怎么配置虚拟机Ubuntu.这里就不做过多叙述,需要说明的是,kali和ubuntu都可以以shell运行这个C语言程序 ...
- 利用浏览器favicon的缓存机制(F-Cache)生成客户端浏览器唯一指纹
利用浏览器favicon的缓存机制(F-Cache)生成客户端浏览器唯一指纹 首先介绍下: 这个技术出自 UIC论文:https://www.cs.uic.edu/~polakis/papers/so ...