A1056. Mice and Rice (25)
来源:互联网 发布:马尔可夫矩阵的计算题 编辑:程序博客网 时间:2024/06/05 19:34
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 NG winners 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 Wi is 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<cstdio>#include<queue>using namespace std;const int maxn = 1001;struct Mouse{int weight,Rank;}mice[maxn];int main(){queue<int> q;int np,ng,order;scanf("%d %d",&np,&ng);for(int i = 0;i < np;i++){scanf("%d",&mice[i].weight);}for(int i = 0;i < np;i++){scanf("%d",&order);q.push(order);}int temp = np,group;//分别记录当前轮的队列中老鼠总数,组数while(q.size()!=1){if(temp%ng) group = temp/ng+1;else group = temp/ng;for(int i = 0;i < group;i++){int k = q.front();for(int j = 0;j < ng;j++){if(i*ng+j>=temp) break;//最后一组数量不足ng时跳出int first = q.front();if(mice[first].weight>mice[k].weight)k = first;mice[first].Rank = group+1;//定排名,想想为什么这么做q.pop();}q.push(k);//胜利者晋级}temp = group;}mice[q.front()].Rank = 1;for(int i = 0;i < np;i++){if(i<np-1) printf("%d ",mice[i].Rank);else printf("%d\n",mice[i].Rank);}return 0;}
- A1056. Mice and Rice (25)
- A1056. Mice and Rice (25)
- A1056. Mice and Rice (25)
- 【PAT】A1056. Mice and Rice (25)
- pat-a1056. Mice and Rice (25)
- PAT A1056. Mice and Rice (25)
- PAT A1056 Mice an Rice
- PAT1056.Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)*
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- Android-基本控件(Spanner 下拉列表)
- scala学习之:scala多重界定代码实战及其在Spark中的应用
- Nginx开发从入门到精通一
- FZU-2146 Easy Game
- php中的数据类型详解
- A1056. Mice and Rice (25)
- Struts2文件上传与下载
- C++实现栈
- Android binder 原理及实现机制<一>
- 暑假第5周工作周报
- 打不开Eclipse,Eclipse闪退(已解决)
- dijkstra算法(Pascal描述)
- mysql覆盖索引
- php中的变量详解