1056. Mice and Rice (25)
2017-06-02 21:29
381 查看
100 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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.
Input Specification:
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.
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
参照算法笔记P262
用队列模拟。
假设当前老鼠有temp只,如果temp%NG==0,则组数group=temp/NG,否则group=temp/NG+1,并且最后一组单独讨论。
由于每组晋级一只老鼠,因此当轮晋级的老鼠总数等于group,未晋级的老鼠排名为group+1.
#include<stdio.h> #include<queue> using namespace std; queue<int>q; struct node{ int weight; int rank; }stu[1010]; int main(){ int n,m,i,j,weight,order; scanf("%d %d",&n,&m); for(i=0;i<n;i++){ scanf("%d",&stu[i].weight); } for(i=0;i<n;i++){ scanf("%d",&order); q.push(order); } int temp=n,group,flag; while(q.size()>1){ flag=0; if(temp%m==0){ group=temp/m; } else{ group=temp/m+1;flag=1; } for(i=0;i<group;i++){ int head; int maxindex=q.front(); if(flag&&i==group-1){//最后一组单独讨论 for(j=0;j<temp%m;j++){ head=q.front(); if(stu[head].weight>stu[maxindex].weight){ maxindex=head; } stu[head].rank=group+1;//晋级的老鼠排名会在下一轮更改 q.pop(); } q.push(maxindex); } else{ for(j=0;j<m;j++){ head=q.front(); if(stu[head].weight>stu[maxindex].weight){ maxindex=head; } stu[head].rank=group+1;//晋级的老鼠排名会在下一轮更改 q.pop(); } q.push(maxindex); } } temp=group;//更新晋级老鼠数 } stu[q.front()].rank=1; for(i=0;i<n;i++){ printf("%d",stu[i].rank); if(i!=n-1){ printf(" "); } } }
相关文章推荐
- 1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- PAT A 1056. Mice and Rice (25)
- PAT (Advanced Level) 1056. Mice and Rice (25) 模拟比赛,用queue辅助
- PAT 1056. Mice and Rice (25)(依照一定顺序给数列排序并输出)
- PAT (Advanced Level) Practise 1056 Mice and Rice (25)
- 1056. Mice and Rice (25)【模拟】——PAT (Advanced Level) Practise
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)PAT甲级
- PAT 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)
- pat 甲级 1056. Mice and Rice (25)
- 浙大2013复试:PAT 1056. Mice and Rice (25)