PAT-1056 Mice and Rice

1056 Mice and Rice (25)（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

注意淘汰赛排名规则，无论多少人一组，某一轮胜出k人的话，本轮淘汰掉的人并列第k+1名。还有注意看题，我刚开始把第三行输入当成初始时第i个人的出场顺序，浪费了很多时间。

#include<stdio.h>
#include<queue>
#include<math.h>
using namespace std;

typedef struct mice{
	int id,w,rank;
	friend bool operator <(mice m1,mice m2){return m1.w<m2.w;}
}mice;
mice m[1000];
vector<mice> list;
int main(){
	int np,ng;
	scanf("%d %d",&np,&ng);
	int t;
	for(int i=0;i<np;i++){
		scanf("%d",&t);
		m[i].w=t;m[i].id=i;
		m[i].rank=1;
	}
	for(int i=0;i<np;i++){
		scanf("%d",&t);
		list.push_back(m[t]);
	}

	vector<mice> next;
	priority_queue<mice> q;
	while(list.size()>1){
		int size=list.size();
		int rank=ceil(size*1.0/ng)+1;

		for(int i=0;i<list.size();i++){
			q.push(list[i]);
			if(i%ng==ng-1){
				next.push_back(q.top());
				q.pop();
				while(!q.empty()){
					m[q.top().id].rank=rank;
					q.pop();
				}
			}
		}
		if(!q.empty()){
			next.push_back(q.top());
			q.pop();
			while(!q.empty()){
				m[q.top().id].rank=rank;
				q.pop();
			}
		}
		list.clear();
		for(int i=0;i<next.size();i++)
			list.push_back(next[i]);
		next.clear();
	}
	m[list[0].id].rank=1;

	printf("%d",m[0].rank);
	for(int i=1;i<np;i++){
		printf(" %d",m[i].rank);
	}
	return 0;
}