甲级PAT 1056 Mice and Rice （25 分）（模拟比赛）

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

题目说明以后补。

注意

第三行给出的数字，是指对应的比赛人的id,所以比赛顺序实际上是第6个人，第0个人，第8个人，前三个作为一组。如果有人数不足三的，将剩下的人归为一组。

完整代码

#include<bits/stdc++.h>
using namespace std;

struct Mice{
	int weight,id,level;
}mice[1010];
int np,ng;

vector<vector<Mice> > fail;
vector<Mice> playlist,winlist;

bool com(Mice m1,Mice m2){
	return m1.weight>m2.weight;
}
void fight(int start,int end,int level){
	if(start<end){
		sort(playlist.begin()+start,playlist.begin()+end+1,com);
		for(int i=start+1;i<=end;i++){
			fail[level].push_back(playlist[i]);
		}
		winlist.push_back(playlist[start]);
	}else if(start==end) winlist.push_back(playlist[start]);
}

int part(int start,int end,int level){
	int i;
	for(i=start;i<end;i+=ng){
		int pos=min(i+ng,end);
		fight(i,pos-1,level);
	}
	playlist=winlist;
	winlist.clear();
	return playlist.size();
}

int main(){
	int i,j,pid;
	cin>>np>>ng;
	playlist.resize(np);
	fail.resize(500);
	for(i=0;i<np;i++){
		cin>>mice[i].weight;
		mice[i].id=i;
	}
	for(i=0;i<np;i++){
		cin>>pid;
		playlist[i]=mice[pid];
	}
	int outlevel=0;
	while(part(0,playlist.size(),outlevel)!=1) outlevel++;
	mice[playlist[0].id].level=1;
	int level=2;
	for(i=outlevel;i>=0;i--){
		for(j=0;j<fail[i].size();j++){
			int id=fail[i][j].id;
			mice[id].level=level;
		}
		level+=fail[i].size();
	}
	for(i=0;i<np;i++){
		if(i!=0) cout<<" ";
		cout<<mice[i].level;
	}
	return 0;
}