【PAT】A1056 Mice and Rice【队列】

最新推荐文章于 2022-11-14 17:51:21 发布

昵称五个字

最新推荐文章于 2022-11-14 17:51:21 发布

阅读量681

点赞数 1

分类专栏： PAT

本文链接：https://blog.csdn.net/a617976080/article/details/96842055

版权

本文介绍了一种编程竞赛的规则，参赛者需要控制虚拟老鼠在地图上寻找大米，最重的老鼠获胜。程序需要根据输入的程序员数量、每组老鼠数量、老鼠权重和初始比赛顺序，计算出每个程序员（对应的老鼠）的最终排名。通过使用队列模拟比赛过程，每次比赛计算出晋级者，更新排名，直至决出最后的胜者。

摘要由CSDN通过智能技术生成

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 3
25 18 0 46 37 3 19 22 57 56 10
6 0 8 7 10 5 9 1 4 2 3

Sample Output:

5 5 5 2 5 5 5 3 1 3 5

题意

有NP只老鼠，每NG只老鼠为一组进行竞赛，每组最重的老鼠晋级，其他老鼠淘汰，淘汰的老鼠排名相同。现给出老鼠的重量和顺序，求最终各个老鼠的排名。

思路

首先可以简单证明，当前老鼠分为group组时，被淘汰的老鼠的排名是group+1。这样不断淘汰直到剩下一只老鼠，比赛结束。题目增加了难度，老鼠不是依次比赛，而是按照题目给的序列，进行比赛。所以我们使用一个队列来依次存放老鼠对应的下标。每一轮比赛都要先将当前队列的长度（也就是该轮老鼠的个数）缓存到变量cnt中，然后计算组数，用一个二重循环找出每组晋级者，所有老鼠出列，计算排名，每组晋级者重新入列。这样不断循环直到队列里只有一只老鼠（不能把循环结束条件改为0是因为只有一只老鼠的时候它会不断晋级，这样就无限循环了），最后需要将最后一只老鼠的排名设为1。