PAT (Advanced Level) 1056 Mice and Rice （25 分）

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 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

Code:

#include 
#include 
#include 
#include 
#pragma warning(disable:4996)

using namespace std;

struct Player
{
	int id, weight, order;
	Player() {}
	Player(int i, int w, int o) :id(i), weight(w), order(o) {}
	bool operator < (const Player& p) const
	{
		return this->weight < p.weight;
	}
};

int main()
{
	int np, ng;
	scanf("%d%d", &np, &ng);
	vector<Player> vec;
	vector<int> w(np);
	for (int i = 0; i < np; i++)
		scanf("%d", &w[i]);
	for (int i = 0; i < np; i++)
	{
		int num;
		scanf("%d", &num);
		vec.push_back(Player(i, w[num], num));
	}
	priority_queue<Player> group;
	queue<Player> total;
	vector<int> rank(np, 0);
	for (int i = 0; i < vec.size(); i++)
		total.push(vec[i]);
	while (total.size() > 1)
	{
		queue<Player> winner;
		int turn = total.size() / ng + (total.size() % ng != 0);
		for (int i = 0; i < turn; i++)
		{
			for (int j = 0; j < ng && !total.empty(); j++)
			{
				group.push(total.front());
				total.pop();
			}
			winner.push(group.top());
			group.pop();
			while (!group.empty())
			{
				rank[group.top().order] = turn + 1;
				group.pop();
			}
		}
		while (!winner.empty())
		{
			total.push(winner.front());
			winner.pop();
		}
	}
	Player final_winner = total.front();
	rank[final_winner.order] = 1;
	for (int i = 0; i < rank.size(); i++)
		printf("%d%c", rank[i], (i == rank.size() - 1 ? '\n' : ' '));
	return 0;
}