PAT-A-1056. Mice and Rice (25)
来源:互联网 发布:水产品进出口数据 编辑:程序博客网 时间:2024/06/05 09:18
1056. Mice and Rice (25)
Mice and Rice is the name of a programming contest in which each programmer must write a piece of code to control the movements of a mouse in a given map. The goal of each mouse is to eat as much rice as possible in order to become a FatMouse.
First the playing order is randomly decided for NP programmers. Then every NG programmers are grouped in a match. The fattest mouse in a group wins and enters the next turn. All the losers in this turn are ranked the same. Every NGwinners are then grouped in the next match until a final winner is determined.
For the sake of simplicity, assume that the weight of each mouse is fixed once the programmer submits his/her code. Given the weights of all the mice and the initial playing order, you are supposed to output the ranks for the programmers.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers: NP and NG (<= 1000), the number of programmers and the maximum number of mice in a group, respectively. If there are less than NG mice at the end of the player's list, then all the mice left will be put into the last group. The second line contains NP distinct non-negative numbers Wi (i=0,...NP-1) where each Wiis the weight of the i-th mouse respectively. The third line gives the initial playing order which is a permutation of 0,...NP-1 (assume that the programmers are numbered from 0 to NP-1). All the numbers in a line are separated by a space.
Output Specification:
For each test case, print the final ranks in a line. The i-th number is the rank of the i-th programmer, and all the numbers must be separated by a space, with no extra space at the end of the line.
Sample Input:11 325 18 0 46 37 3 19 22 57 56 106 0 8 7 10 5 9 1 4 2 3Sample Output:
5 5 5 2 5 5 5 3 1 3 5
#include<iostream>#include<cstdio>#include<queue>using namespace std;const int maxn = 1010;struct mouse{ int weight; int r;}mouse[maxn];int main(){ int np, ng, order; cin >> np >> ng; for (int i = 0; i < np; i++) cin >> mouse[i].weight; queue<int> q; for (int i = 0; i < np; i++) { cin >> order; q.push(order); } int temp = np; int group; while (q.size() != 1) { if (temp%ng == 0) group = temp / ng; else group = temp / ng + 1; for (int i = 0; i < group; i++) { int k = q.front(); for (int j = 0; j < ng; j++) { if (i*ng + j>=temp) break; int f = q.front(); if (mouse[f].weight>mouse[k].weight) k = f; mouse[f].r = group + 1; q.pop(); } q.push(k); } temp = group; } mouse[q.front()].r = 1; for (int i = 0; i < np; i++) { cout << mouse[i].r; if (i < np - 1) cout << " "; } cout << endl; system("pause"); return 0;}
- PAT A 1056. Mice and Rice (25)
- PAT(A) - 1056. Mice and Rice (25)
- PAT-A-1056. Mice and Rice (25)
- 1056. Mice and Rice (25)-PAT
- PAT 1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- 【PAT】1056. Mice and Rice (25)
- 【PAT甲级】1056. Mice and Rice (25)
- 1056. Mice and Rice (25)PAT甲级
- PAT甲级1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- PAT 甲级 1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)PAT
- PAT 1056. Mice and Rice
- 【PAT】1056. Mice and Rice
- 【C++】PAT(advanced level)1056. Mice and Rice (25)
- Pointcut is not well-formed: expecting 'name pattern' at character position
- 第一个程序:HelloWorld
- [模板]
- C# Process执行cmd指令,实时获取输出并隐藏cmd窗口
- 使用包管理 Java 中的类
- PAT-A-1056. Mice and Rice (25)
- ThinkPHP5.0-响应
- 设置div最小宽度
- JSTL(1)使用JSTL
- IOS开发之实现App消息推送(最新)
- 重新定义日志成员
- page、request、session、application的范围
- Sublime Text_Package Control:There are no packages available for installation 的另一种解决方法
- 计划写个分布式爬虫来对近十年开发的总结