PAT甲级 1056

题目 Mice and Rice

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.

解析

1. 有np只老鼠分组，每组ng只
   np：11 ng：3
   W​i为每只老鼠的体重，
   W​i：25 18 0 46 37 3 19 22 57 56 10
   Ii 在Wi中的i，其中ng=3所以每三个为一组及[W6,W0,W8]为一组，[W7,W10,W5]…[W2,W3]
   Ii：6 0 8 7 10 5 9 1 4 2 3
   从每组中选出体重最大的那只老鼠，进行下一次和其他组最大的比。其他失败的则排名一致
2. 排名及每次晋级的老鼠数量+1（最后结果5的由来，为什么没有4）

代码

#include<bits/stdc++.h>

#define INF 1<<29

using namespace std;
struct node {
    int i;
    int data;
    int rank;
};
int np, ng;
vector<node> weight;
vector<int> need_order;

void pat1056() {
    cin >> np >> ng;
    for (int i = 0; i < np; ++i) {
        int w;
        cin >> w;
        node n = {
                i, w, -1
        };
        weight.push_back(n);
    }
    for (int i = 0; i < np; ++i) {
        int l;
        cin >> l;
        need_order.push_back(l);
    }
    //获取当前晋级的排名，分的组数+1.如果多出来一组（不满）则在加1
    int r = need_order.size() % ng ? (need_order.size() / ng) + 2 : (need_order.size() / ng) + 1;
    while (need_order.size() != 1) {
        int t = 0;
        vector<int> need;
        do {
            int max = -1;
            int in = 0;
            for (int h = t; h < t + ng && h < weight.size() && h < need_order.size(); h++) { //获取这一小组中最大的位置
                if (max < weight[need_order[h]].data) {
                    max = weight[need_order[h]].data;
                    in = need_order[h];
                }
            }
            //除了最大的，其他的rank都设置为r（之前算过的）。并将最大的位置放置到下一次需要比较
            for (int h = t; h < t + ng && h < weight.size() && h < need_order.size(); h++) {
                if (in != need_order[h]) {
                    weight[need_order[h]].rank = r;
                }
            }
            need.push_back(in);
            //下一小组
            t += ng;
        } while (t < need_order.size());
        need_order = need;
        r = need_order.size() % ng ? (need_order.size() / ng) + 2 : (need_order.size() / ng) + 1;
    }
    weight[need_order[0]].rank = 1;

    for (int i = 0; i < weight.size(); ++i) {
        cout << weight[i].rank ;
        if(i !=weight.size()-1){
            cout<<" ";
        }
    }
}

int main() {
    pat1056();
    return 0;
}