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

---

题目大意：

代码：

#include<stdio.h>
#include<queue>
using namespace std;
int arr[1001];
int order[1001];
int main()
{
    int i,j,n,m,k;
    queue<int > que;
    scanf("%d %d",&n,&m);
    for(i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
    }
    for(i=0;i<n;i++)
    {
        scanf("%d",&k);
        que.push(k);
    }
    while(que.size()!=1)
    {
        int num=que.size()/m;
        if(que.size()%m!=0)
        {
            num+=1;
        }
        queue<int> tmp;
        for(i=0;i<num;i++)
        {
            int Max=-1;
            int index=-1;
            for(j=0;j<m&&que.size()>0;j++)
            {
                int t=que.front();
                order[t]=num+1;
                que.pop();
                if(arr[t]>Max)
                {
                    Max=arr[t];
                    index=t;
                }
            }
            tmp.push(index);
        }
        que=tmp;
    }
    order[que.front()]=1;
    for(i=0;i<n;i++)
    {
        if(i==0)
            printf("%d",order[i]);
        else
            printf(" %d",order[i]);
    }
    return 0;
}