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

主要是对STL中queue的运用，AC代码如下：

#include<cstdio>
#include<vector>
#include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
struct Node
{
	int rank;
	int num;
};
int main(void) {
	vector<Node> list;
	int Np, Ng;
	cin >> Np >> Ng;
	int temp;
	for (int i = 0;i < Np;i++) {
		cin >> temp;
		Node a;
		a.num = temp;
		list.push_back(a);
	}
	queue<int> rank_list;
	for (int i = 0;i < Np;i++) {
		cin >> temp;
		rank_list.push(temp);
	}
	int group,sum = Np;
	while (rank_list.size() > 1) {
		if (sum % Ng == 0) {
			group = sum / Ng;
		}
		else group = sum / Ng + 1;
		for (int i = 0;i < group;i++) {
			int k = rank_list.front();
			int front;
			for (int j = 0;j < Ng;j++) {
				if ((i * Ng + j) >= sum)
					break;
				front = rank_list.front();
				if (list[k].num < list[front].num)
					k = front;
				list[front].rank = group + 1;
				if(!rank_list.empty())
				    rank_list.pop();
			}
			rank_list.push(k);
		}
		sum = group;
	}
	int max = rank_list.front();
	list[max].rank = 1;
	cout << list[0].rank;
	for (int i = 1;i < Np;i++) {
		cout << " " << list[i].rank;
	}
}