PAT 1056 Mice and Rice [queue]

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 N​P​​ programmers. Then every N​G​​ 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 N​G​​ 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: N​P​​ and N​G​​ (≤1000), the number of programmers and the maximum number of mice in a group, respectively. If there are less than N​G​​ 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 N​P​​ distinct non-negative numbers W​i​​ (i=0,⋯,N​P​​−1) where each W​i​​ is the weight of the i-th mouse respectively. The third line gives the initial playing order which is a permutation of 0,⋯,N​P​​−1 (assume that the programmers are numbered from 0 to N​P​​−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

--------------------------------这是题目和解题的分割线--------------------------------

The third line gives the initial playing order which is a permutation of 0,⋯,N​P​​−1 (assume that the programmers are numbered from 0 to N​P​​−1). 这句话没看懂，跑去看中文，好半天才明白意思，我的理解能力也太差了oTATo

第三行其实就是第二行的id们来帮忙排队，6是下标为6的数字现在排在第一个位置。

#include<cstdio>
#include<queue>

using namespace std;

struct node
{
	int rank;
	int weight;
}mice[1010];

int main()
{
	int n,maxG,i,j,id;
	queue<int> q; //队列方便删除插入操作 
	scanf("%d%d",&n,&maxG);
	for(i=0;i<n;i++)
		scanf("%d",&mice[i].weight);
	for(i=0;i<n;i++)
	{
		scanf("%d",&id);
		q.push(id); //直接比较id们就好啦，最后对应输出 
	}
	int group,tmp = n;
	//当对列只剩下一个元素，说明不能再分组也就是比赛结束 
	while(q.size()!=1)
	{
		if(tmp%maxG==0) group = tmp/maxG;
		else group = tmp/maxG+1; //如果不能整除，多分一个组给多出来的 
		//每组比赛 
		for(i=0;i<group;i++)
		{
			int maxM = q.front(); //记录最大值的下标而不是最大值，方便队列插入 
			//每支队伍 
			for(j=0;j<maxG;j++)
			{
				if(i*maxG+j>=tmp) break; //最后一组数量不足maxG时不能越界，得提前结束循环 
				if(mice[q.front()].weight>mice[maxM].weight)
					maxM = q.front();
				//x支队伍会产生x个胜出者，排名前x，剩余的老鼠的排名并列x+1 
				//排名一样没有关系，胜出者在下一轮的排名会更新 
				mice[q.front()].rank = group+1;
				//全部删除没有关系，待会儿将胜出者加回队伍
				q.pop(); 
			}
			q.push(maxM); //胜出者加回来，先进先出，比赛顺序不会打乱  
		}
		tmp = group; //更新比赛鼠数 
	}
	mice[q.front()].rank = 1; //别忘了第一名 
	for(i=0;i<n;i++)
	{
		printf("%d",mice[i].rank);
		if(i!=n-1) printf(" ");
	}
	return 0;	
}