PAT甲级真题 1056 Mice and Rice (25分) C++实现（数组模拟分组淘汰赛，map记录重量排名，题意分析）

题目

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

思路

题意不太好理解。一开始想画出晋级图后倒推，按所处层数给排名，发现怎么没有第4名呢？在网上看了别人的解析才知道，排名是这么来的：第一轮分4个组，出现4个优胜者，那么剩下的就都是第5名，即失败者排名都是分组数+1。

用unordered_map类型的rank记录每个重量的排名，接下来只需记录和比较重量。

用数组v记录本轮参赛重量，先给所有重量的rank统一赋值为组数+1，例如测试用例中第一轮rank[19]=5, rank[25]=5…

遍历数组v找当前最大重量。当到达每组结束位置时（分两种情况，完整组的结束和最后剩余组的结束），当前最大重量即为该组优胜者，将其加入新数组u，并重置当前最大重量。

处理完毕后进入下一轮循环&#x