1056 Mice and Rice

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

解析：模拟会题意。

一直看不懂题目，看不懂的和我一起举个手。哈哈

“ initial playing order”初始的顺序，也就是6 0 8一组先比，6是19，

#include<set>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<cmath>
#include<stack>
#include<cstdio>
#include<string>
#include<bitset>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;

#define e exp(1)
#define pp acos(-1)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define mem(a,b) memset(a,b,sizeof(a))
int gcd(int a,int b) {
	return b?gcd(b,a%b):a;
}

const int maxn=1e3+5;
vector<int> v;
int a[maxn];
int n,p,x;
int main()
{
	scanf("%d%d",&n,&p);
	for(int i=0; i<n; i++)
	{
		scanf("%d",&x);
		v.push_back(x);
	}
	queue<int> q;
	for(int i=0; i<n; i++)
	{
		scanf("%d",&x);
		q.push(x);
	}
	
	int N=n;
	int group;
	while(q.size()!=1)
	{
		if(N%p!=0)group=N/p+1;
		else group=N/p;
		
		for(int i=0; i<group; i++)
		{
			int k=q.front();
			for(int j=0; j<p; j++)
			{
				if(i*p+j>=N)break;
				int temp=q.front();
				if(v[temp]>v[k])
				{
					k=temp;
				}
				q.pop();a[temp]=group+1;
			}
			q.push(k);
		}
		N=group;
	}
	a[q.front()]=1;
	for(int i=0; i<n-1; i++)
	{
		printf("%d ",a[i]);
	}
	printf("%d\n",a[n-1]);
	return 0;
}

第二组是7 10 5，以此类推。