PTA-queue(1056)

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 Pprogrammers. 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 Gwinners 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 Pand N G(≤1000), the number of programmers and the maximum number of mice in a group, respectively. If there are less than N Gmice 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 Pdistinct 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

思路

利用队列，模拟游戏流程。
每次被淘汰的序号即是组数+1，每次淘汰后剩下“组数”个人，不断循环出队直到剩下一个即为第一名。

#include<bits/stdc++.h>
using namespace std;
struct mice{
	int weight;
	int order;
};
vector<mice> ans(1001);
int main()
{
	int n,m;
	cin>>n>>m;
	for(int i=0;i<n;i++){
		scanf("%d",&ans[i].weight);
	}
	queue<int> que;
	for(int i=0;i<n;i++){
		int num;
		cin>>num;
		que.push(num);
	}
	int cnt=n;
	while(que.size()!=1){
		int num=cnt/m;
		if(cnt%m!=0) num++;
		for(int i=0;i<num;i++){
			int k=que.front();
			for(int j=1;j<=m;j++){
				if(i*m+j>cnt) break;
				int q=que.front();
				if(ans[q].weight>ans[k].weight){
					k=q;
				}
				que.pop();
				ans[q].order=num+1;
			}
			que.push(k);
		}
		cnt=num;
	}
	ans[que.front()].order=1;
	for(int i=0;i<n;i++){
		cout<<ans[i].order;
		if(i!=n-1) cout<<' ';
	}
	return 0;
}