题目

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 lef 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

题目分析

已知参赛人数N,每组人数M,参赛者体重,起始参赛顺序。每组最重者获胜,每轮有M个人获胜进入下一组进行下一轮比赛

注:因为每轮比赛,有M个人获胜,所以其余失败者排名为M+1,获胜者排名为M

解题思路

  1. 定义queue队列,模拟比赛流程,每场比赛所有参赛者入队,并在最后设置哨兵(哨兵表明本轮比赛结束)
  2. 与层级遍历树结构的差别:本题目中退出队列循环标识为参赛人数为1,而层级遍历树退出队列循环标识为队列中没有节点
  3. 每次循环到下一组第一个参赛者时,将前一组的获胜者设置排名添加到队列最后,准备下一场比赛

Code

#include <iostream>
#include <queue>
using namespace std;
struct M {
int w=-1;//weight
int i=-1;//id
int r=-1;//rank
};
int main(int argc,char * argv[]) {
int np,ng,t;
scanf("%d%d",&np,&ng);
M ms[np+1];
for(int i=0; i<np; i++) {
scanf("%d",&ms[i].w);
ms[i].i=i;
}
M em;
ms[np]=em;
queue<int> q;
for(int i=0; i<np; i++) {
scanf("%d",&t);
q.push(t);
}
int group = np%ng==0?np/ng:np/ng+1;
int max=np,cs=np;
q.push(-1);//第一轮最后加一个哨兵
for(int i=1; group>=1&&q.size()>=1; i++) {
int cur = q.front();
if(cur!=-1)ms[cur].r = group+1;
if(cur==-1) { // 若本轮比赛结束
q.pop(); //将哨兵弹出,方便计算下一场比赛人数
ms[max].r = group; //添加上一轮比赛最后一组的获胜者到队列,预备下一场比赛
if(cs==1)break; //如果当前参赛人员只有一人,并且已完成排名,退出
q.push(max); //将本组获胜者加入队列,预备下一轮比赛
cs=q.size(); //下一轮参赛人数
group=(cs%ng==0?cs/ng:cs/ng+1); //重新计算group
q.push(-1); //每一轮最后加一个哨兵
max=np; //max置为哨兵参照,weight=-1
i=0; //重置 指针
continue;
} else if(i!=1&&i%ng==1) { //一组统计完成,当前为下一组第一个参赛者
ms[max].r = group;
q.push(max);//将本组获胜者加入队列,预备下一轮比赛
max=cur; //cur为下一组的第一个参赛者
} else if(ms[max].w<ms[cur].w) { //更新本组获胜者
max=cur;
}
q.pop();
}
for(int i=0; i<np; i++) {
if(i!=0)printf(" ");
printf("%d",ms[i].r);
}
return 0;
}

PAT Advanced 1056 Mice and Rice (25) [queue的⽤法]的更多相关文章

  1. pat 甲级 1056. Mice and Rice (25)

    1056. Mice and Rice (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Mice an ...

  2. PAT 甲级 1056 Mice and Rice (25 分) (队列,读不懂题,读懂了一遍过)

    1056 Mice and Rice (25 分)   Mice and Rice is the name of a programming contest in which each program ...

  3. 1056 Mice and Rice (25分)队列

    1.27刷题2 Mice and Rice is the name of a programming contest in which each programmer must write a pie ...

  4. 1056. Mice and Rice (25)

    时间限制 30 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Mice and Rice is the name of a pr ...

  5. PAT (Advanced Level) 1056. Mice and Rice (25)

    简单模拟. #include<iostream> #include<cstring> #include<cmath> #include<algorithm&g ...

  6. PAT甲题题解-1056. Mice and Rice (25)-模拟题

    有n个老鼠,第一行给出n个老鼠的重量,第二行给出他们的顺序.1.每一轮分成若干组,每组m个老鼠,不能整除的多余的作为最后一组.2.每组重量最大的进入下一轮.让你给出每只老鼠最后的排名.很简单,用两个数 ...

  7. 【PAT甲级】1056 Mice and Rice (25 分)

    题意: 输入两个正整数N和M(<=1000),接着输入两行,每行N个数,第一行为每只老鼠的重量,第二行为每只老鼠出战的顺序.输出它们的名次.(按照出战顺序每M只老鼠分为一组,剩余不足M只为一组, ...

  8. pat1056. Mice and Rice (25)

    1056. Mice and Rice (25) 时间限制 30 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Mice and ...

  9. PAT 1056 Mice and Rice[难][不理解]

    1056 Mice and Rice(25 分) Mice and Rice is the name of a programming contest in which each programmer ...

随机推荐

  1. 056-for循环中continue的使用

    <?php ; $i <= ; $i++) { //for循环输出数值 == ) //判断变量是否为3的整数倍 { continue;//跳过本次循环剩余语句 } echo "$ ...

  2. 控制台连接oracle11g报ORA-12560异常

    oracle11g R2 64bit oracleClient 11.2 32bit PL/SQL Developer 11.0.2 32bit 今天发现了一个奇怪的现象,如图: 后来发现机器上既有s ...

  3. you-get加ffmpeg获取视频素材并转格式

    最近做视频,觉得素材不好下载,下载了转格式又很麻烦,终于,在网上ob了很久的我找到了属于自己的工具. you-get视频下载 当你在网上找视频素材的时候发现了一个自己觉得很有意思的视频,但是获取这个视 ...

  4. 实验吧-隐写术-男神一般都很低调很低调的!!(stegsolve->Image Combiner + DES加密)

    先介绍一下DES加密:(也可参考https://blog.csdn.net/zz_Caleb/article/details/87016017,第14个) 1)对称加密,参考:对称加密和非对称加密 2 ...

  5. 吴裕雄 Bootstrap 前端框架开发——Bootstrap 字体图标(Glyphicons):glyphicon glyphicon-text-width

    <!DOCTYPE html> <html> <head> <meta charset="utf-8"> <meta name ...

  6. 黑马oracle_day01:01.oracle体系结构

    01.oracle体系结构 02.oracle的基本操作 03.oracle的查询 04.oracle对象 05.oracle编程 01.oracle体系结构 开发环境:VMware® Worksta ...

  7. spring监听器+定时任务

    背景:在原SSM项目中,拟定在每晚的23:59:59执行一个批处理任务. 设计思路:用jdk自带的定时器触发任务执行,设置下次执行间隔为24小时.定时任务由spring的监听器去启动. jdk版本:1 ...

  8. 04-String——课后作业1:字串加密

    题目:请编写一个程序,加密或解密用户输入的英文字串要求设计思想.程序流程图.源代码.结果截图. 程序设计思想:首先由用户选择是加密还是解密,利用String类中的charAt函数依次取出字串中的字符, ...

  9. .NET CORE AutoMapper使用

    1.通过nuget安装AutoMapper,版本是7.0.1, 安装AutoMapper.Extensions.Microsoft.DependencyInjection  版本是4.0.1 不是以上 ...

  10. 8.scrapy的第一个实例

    [目标]要完成的任务如下: ※ 创建一个 Scrap项目.※ 创建一个 Spider来抓取站点和处理数据.※ 通过命令行将抓取的内容导出.※ 将抓取的内容保存的到 MongoDB数据库.======= ...