1016 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 NP programmers. Then every NG 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 NG 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.

输入描述:

Each input file contains one test case. For each case, the first line contains 2 positive integers: NP and NG (<= 1000), the number of programmers and the maximum number of mice in a group, respectively. If there are less than NG 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 NP distinct non-negative numbers Wi (i=0,…NP-1) where each Wi is the weight of the i-th mouse respectively. The third line gives the initial playing order which is a permutation of 0,…NP-1 (assume that the programmers are numbered from 0 to NP-1). All the numbers in a line are separated by a space.

输出描述:

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.

输入例子:
11 3
25 18 0 46 37 3 19 22 57 56 10
6 0 8 7 10 5 9 1 4 2 3

输出例子:
5 5 5 2 5 5 5 3 1 3 5

package p1016;

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int num = sc.nextInt();
        int per = sc.nextInt();

        int[] ranks = new int[num];

        int[] weight = new int[num];
        for(int i=0; i<num; i++)
            weight[i] = sc.nextInt();

        Queue<Integer> q  = new LinkedList<Integer>();
        Queue<Integer> qq = new LinkedList<Integer>();


        //int[] pairs = new int[num];
        for(int i=0; i<num; i++)
            q.add(sc.nextInt());
            //pairs[i] = sc.nextInt();
        Queue<Integer> q_copy  = new LinkedList<Integer>(q);

        while(true) {

            while(!q.isEmpty()) {

                int max = 0, max_index = 0;
                for(int i=0; i<per && !q.isEmpty(); i++) {
                    int j = q.remove();
                    if(weight[j] > max) {
                        max = weight[j];
                        max_index = j;
                    }
                }
                qq.add(max_index);
            }

            int len = qq.size();
            for(int i : q_copy) {
                if(!qq.contains(i)) {
                    ranks[i] = len + 1;
                }
            }

            if(qq.size() == 1) {
                ranks[qq.peek()] = 1;
                break;
            }

            q = qq;
            qq = new LinkedList<Integer>();
            q_copy = new LinkedList<Integer>(q);

        }

        for(int i=0; i<num-1; i++) 
            System.out.print(ranks[i] + " ");
        System.out.println(ranks[num-1]);
    }
}

Just code like what the problem says, It is a little like BFS