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

Code:

#include<stdio.h>
#include<queue>
using namespace std;
struct mouse{
    int weight;
    int rank;
}mouse[1010];
int main(){
    int np,ng,order;
    scanf("%d %d",&np,&ng);
    int i;
    for(i=0;i<np;i++){
        scanf("%d",&mouse[i].weight);
    }
    queue<int> q;
    for(i=0;i<np;i++){
        scanf("%d",&order);
        q.push(order);
    }
    int temp = np,group;
    while(q.size() != 1){
        if(temp % ng == 0){
            group = temp / ng;
        }
        else{
            group = temp / ng + 1;
        }
        for(i=0;i<group;i++){
            int k = q.front();
            for(int j = 0;j < ng;j++){
                if(i * ng + j >= temp){
                    break;
                }
                int front = q.front();
                if(mouse[front].weight > mouse[k].weight){
                    k = front;
                }
                mouse[front].rank = group + 1;
                q.pop();
            }
            q.push(k);
        }
        temp = group;
    }
    mouse[q.front()].rank = 1;
    for(i=0;i<np;i++){
        printf("%d",mouse[i].rank);
        if(i != np-1){
            printf(" ");
        }
    }
    return 0;
}

• 点赞
• 收藏
• 分享
• • 文章举报

蕴玉山辉，怀珠川媚 发布了81 篇原创文章 · 获赞 2 · 访问量 5000 私信 关注

标签：25,group,int,each,front,Mice,Rice,mouse,line
来源： https://blog.csdn.net/weixin_44813180/article/details/104197216