8.22 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.

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<iostream>
#include<vector>
#include<algorithm>

using namespace std;

const int N = 1010;

int w[N], res[N], nc, np;

int main()
{
    cin >> nc >> np;
    
    for(int i = 0; i < nc; i ++ )   cin >> w[i];
    
    vector<int>q(nc);
    for(int i = 0; i < nc; i ++ )   cin >> q[i];
    
    while(q.size() > 1)
    {
        vector<int>next;
        int remain = (q.size() + np - 1) / np;
        for(int i = 0; i < q.size();)
        {
            int ed = min((int)q.size(), i + np);
            
            int win = i;
            //在每一组中找出最重的老鼠
            for(int j = i; j < ed; j ++ )
                if(w[q[win]] < w[q[j]])
                    win = j;
            
            next.push_back(q[win]);
            
            //存取淘汰的老鼠的名次
            for(int j = i; j < ed; j ++ )
                if(j != win)
                    res[q[j]] = remain + 1;
            
            i = ed;
        }
        q = next;
    }
    
    res[q[0]] = 1;
    cout << res[0];
    for(int i = 1; i < nc; i ++ ) 
        cout << ' ' << res[i];
    cout << endl;
}