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
思路:按照题目给定order依次将每个玩家加入到一个play队列中,分组进行比赛。每轮输的玩家加入到每轮各自的一个输家队列中,赢家继续留在play队列中进行比赛,直到play队列中只剩下一个玩家,该玩家即为冠军。
#include <cstdio>
#include <vector>
#include <queue>
#include <map>
using namespace std;
// 给定一个队列,每ng个人分为一组进行比赛
// 返回输家的队列,赢家继续留在q中
queue<int> match(queue<int> &q, int ng)
{
queue<int> winner;
queue<int> loser;
int group = q.size() % ng ? q.size() / ng + 1 : q.size() / ng;
for(int i = 0; i < group; i++) //进行n组比赛
{
int maxw = q.front();
for(int j = 0; !q.empty() && j < ng; j++)
{
if(maxw > q.front())
loser.push(q.front());
else if(maxw < q.front())
{
loser.push(maxw);
maxw = q.front();
}
q.pop();
}
winner.push(maxw);
}
q = winner;
return loser;
}
int main()
{
int np, ng;
scanf("%d %d", &np, &ng);
int weight[np], order;
map<int, int> ranks; // wight -> rank
for(int i = 0; i < np; i++)
{
scanf("%d", weight + i); //输入每个老鼠的重量
ranks[weight[i]] = 0; //将每个老鼠的名次置为0
}
queue<int> play; // play始终保存每一轮的胜者们
for(int i = 0; i < np; i++)
{
scanf("%d", &order);
play.push(weight[order]);
}
vector<queue<int> > data;
while(play.size() > 1)
data.push_back(match(play, ng)); //进行比赛,将每轮的输家保存到一个vector中,胜者留在play中
//此时play中只剩一个赢家,排名为1
ranks[play.front()] = 1;
// 计算名次
int nowRank = 2;
for(int i = data.size() - 1; i >= 0; i--)
{
queue<int> temp = data[i];
int len = temp.size();
while(!temp.empty())
{
ranks[temp.front()] = nowRank;
temp.pop();
}
nowRank += len;
}
//输出结果
for(int i = 0; i < np; i++)
{
if(i != 0)
printf(" ");
printf("%d", ranks[weight[i]]);
}
return 0;
}