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思路：
np为老鼠的数量，ng为每组最多g个老鼠。先给出np个老鼠的重量，再给出老鼠的初始顺序（第i名的老鼠是第j号，j从0开始）。每ng个老鼠分为一组，对于每组老鼠，选出最重的那个，晋级下一轮比赛，然后依次再以np个老鼠一组分类，然后选出重量最大的。。。直到只剩下一只老鼠，排名为1.输出为老鼠的排名，这个排名是按照原输入老鼠的顺序输出的。
C++：
#include "iostream"
#include "vector"
#include "algorithm"
#include "queue"
using namespace std;
struct mice
{
int order;
int weight;
int rank;
int index;
};
bool cmp(mice a,mice b){
return a.order<b.order;
}
int main(){
int np,ng,num;
scanf("%d %d",&np,&ng);
vector<mice> mouse(np);
vector<int> v(np);
for(int i = 0; i < np; i++)
scanf("%d", &v[i]);
for(int i = 0; i < np; i++) {
scanf("%d", &num);
mouse[i].weight = v[num];
mouse[i].index = i;
mouse[i].order = num;
}
queue<mice> q;
for(int i = 0; i < np; i++)
q.push(mouse[i]);
while(!q.empty()) {
int size = q.size();
if(size == 1) {
mice temp = q.front();
mouse[temp.index].rank = 1;
break;
}
int group = size / ng;
if(size % ng != 0)
group += 1;
mice maxnode;
int maxn = -1, cnt = 0;
for(int i = 0; i < size; i++) {
mice temp = q.front();
mouse[temp.index].rank = group + 1;
q.pop();
cnt++;
if(temp.weight > maxn) {//在这个组中寻找最大的
maxn = temp.weight;
maxnode = temp;
}
if(cnt == ng || i == size - 1) {
cnt = 0;
maxn = -1;
q.push(maxnode);
}
}
}
sort(mouse.begin(),mouse.end(),cmp);//按playing order排序
for(int i = 0; i < np; i++) {
if(i != 0) printf(" ");
printf("%d", mouse[i].rank);
}
return 0;
}