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 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 NGwinners 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 Wiis 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
#include<stdio.h>
#include<vector>
#include<map>
#include<algorithm>
using namespace std; struct MyStruct
{
int ID;
int wight;
}; struct MyRank
{
int time;
int ID;
}; vector<MyRank> ranking; void fun(vector<MyStruct> vv ,int Ng)
{
vector<MyStruct> tem;
for(int i = ;i< vv.size(); i++)
{
if( i + Ng - < vv.size())
{
int MAX = -;
int index;
int j;
for(j = i ;j < i + Ng ;j++)
{
if(vv[j].wight > MAX)
{
MAX = vv[j].wight;
index = j;
}
}
i = j-;
tem.push_back(vv[index]);
++ranking[vv[index].ID].time;
}
else
{
int MAX = -;
int index;
int j;
for(j = i ;j < vv.size() ;j++)
{
if(vv[j].wight > MAX)
{
MAX = vv[j].wight;
index = j;
}
}
i = j;
tem.push_back(vv[index]);
++ranking[vv[index].ID].time;
}
} if(tem.size() > )
fun(tem,Ng);
} int cmp(MyRank a,MyRank b)
{
return a.time > b.time ;
} int main()
{
int Np,Ng,i;
MyStruct tem;
MyRank Rtem;
int index;
scanf("%d%d",&Np,&Ng);
vector<MyStruct> v1,v2;
for(i = ;i< Np ;i++)
{
scanf("%d",&tem.wight);
tem.ID = i;
Rtem.ID = i;
Rtem.time = ;
ranking.push_back(Rtem);
v1.push_back(tem);
}
for(i = ;i< Np ;i++)
{
scanf("%d",&index);
v2.push_back(v1[index]);
} fun(v2,Ng); sort(ranking.begin(),ranking.end(),cmp);
int result[];
int j = ;
for(i = ;i <ranking.size();i++)
{
result[ranking[i].ID] = j;
int count = ;
int tem = ranking[i].time;
while(i+ <ranking.size()&&tem == ranking[i+].time)
{
++i;
++ count;
result[ranking[i].ID] = j;
}
j = j+count;
} for(i = ;i < Np ;i++)
{
if(i == ) printf("%d",result[i]);
else printf(" %d",result[i]);
}
printf("\n");
return ;
}
1056. Mice and Rice (25)的更多相关文章
- pat 甲级 1056. Mice and Rice (25)
1056. Mice and Rice (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Mice an ...
- 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 ...
- PAT Advanced 1056 Mice and Rice (25) [queue的⽤法]
题目 Mice and Rice is the name of a programming contest in which each programmer must write a piece of ...
- 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 ...
- PAT甲题题解-1056. Mice and Rice (25)-模拟题
有n个老鼠,第一行给出n个老鼠的重量,第二行给出他们的顺序.1.每一轮分成若干组,每组m个老鼠,不能整除的多余的作为最后一组.2.每组重量最大的进入下一轮.让你给出每只老鼠最后的排名.很简单,用两个数 ...
- PAT (Advanced Level) 1056. Mice and Rice (25)
简单模拟. #include<iostream> #include<cstring> #include<cmath> #include<algorithm&g ...
- 【PAT甲级】1056 Mice and Rice (25 分)
题意: 输入两个正整数N和M(<=1000),接着输入两行,每行N个数,第一行为每只老鼠的重量,第二行为每只老鼠出战的顺序.输出它们的名次.(按照出战顺序每M只老鼠分为一组,剩余不足M只为一组, ...
- pat1056. Mice and Rice (25)
1056. Mice and Rice (25) 时间限制 30 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Mice and ...
- PAT 1056 Mice and Rice[难][不理解]
1056 Mice and Rice(25 分) Mice and Rice is the name of a programming contest in which each programmer ...
随机推荐
- Advanced Installer
Advanced Installer是一款功能强大.可生成符合 MS Windows 认证的 Windows Installer 的 MSI 安装包制作工具,具有友好的图形用户界面,直观而且非常简单的 ...
- Mac OS恢复出厂系统方法
1.重新启动时按住“Command()”和"R"键盘 2.选择磁盘工具
- [转]Oracle EBS APIs
FROM:http://blog.csdn.net/pan_tian/article/details/7754598 API To Find Sales Order's Subtotal,discou ...
- LeetCode 45
Jump Game II Given an array of non-negative integers, you are initially positioned at the first inde ...
- No Dialect mapping for JDBC type: -1
MySQL数据库中有张表的字段是text,查询出来后对应的java类型是String,Dialect设置为org.hibernate.dialect.MySQLDialect 运行的时候报错:No D ...
- css尖角
.market-nav-arrow { ; ; ; border-style: solid; border-width: 7px 0px 7px 7px; border-color: transpar ...
- Newtonsoft.Json.dll序列化为json,null值自动过滤
var jSetting = new JsonSerializerSettings {NullValueHandling = NullValueHandling.Ignore}; var json = ...
- SQL_从星期一到星期六自动打卡SQL代码
create proc sp_MarkAutoKQ as begin ) ---创建两个变量,接收当前时间和当天是星期几 set @dateA=getdate() ---获取当前时间 set @dat ...
- 怎么改svn的登陆账号
svn 我想大家都很熟悉.用的也很多.可是上次遇到一个问题 ,就是用别人的svn下载的代码.选择了记住账号密码.结果提交的时候 还是用别人的不大好.结果就想改成自己的账号.第一次改 找了半天.今天给大 ...
- jQuery之锚点带动画跳转特效
背景图片为金木研,这是我最爱的一张图. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" &quo ...