PAT 甲级 1056. Mice and Rice (25)
来源:互联网 发布:温莎公爵间谍 知乎 编辑:程序博客网 时间:2024/05/29 16:53
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 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 325 18 0 46 37 3 19 22 57 56 106 0 8 7 10 5 9 1 4 2 3Sample Output:
5 5 5 2 5 5 5 3 1 3 5
#include <iostream>#include <vector>#include <algorithm>#include <cstring>#include <stack>#include <queue>using namespace std;const int maxn = 1010;struct mouse {int weight;int rank;}mouse[maxn];int main() {int np, ng, order;scanf("%d%d", &np, &ng);for (int i = 0; i < np; i++) {scanf("%d", &mouse[i].weight);}queue<int> q;for (int i = 0; i < np; i++) {scanf("%d", &order);q.push(order);}int temp = np, group;while (q.size() != 1) {if (temp%ng == 0) group = temp / ng;else group = temp / ng + 1;for (int i = 0; i < group; i++) {int k = q.front();for (int j = 0; j < ng; j++) {if (i*ng + j >= temp) break;int front = q.front();if (mouse[front].weight > mouse[k].weight) {k = front;}mouse[front].rank = group + 1;q.pop();}q.push(k);}temp = group;}mouse[q.front()].rank = 1;for (int i = 0; i < np; i++) {printf("%d", mouse[i].rank);if (i != np - 1) printf(" ");}return 0;}
- 【PAT甲级】1056. Mice and Rice (25)
- 1056. Mice and Rice (25)PAT甲级
- PAT甲级1056. Mice and Rice (25)
- PAT 甲级 1056. Mice and Rice (25)
- PAT甲级练习1056. Mice and Rice (25)
- 1056. Mice and Rice (25)-PAT
- PAT 1056. Mice and Rice (25)
- PAT A 1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- 【PAT】1056. Mice and Rice (25)
- PAT(A) - 1056. Mice and Rice (25)
- PAT-A-1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- PAT 1056. Mice and Rice (25)
- 1056. Mice and Rice (25)PAT
- PAT 1056. Mice and Rice
- 【PAT】1056. Mice and Rice
- 聚焦(onfocus)和失焦(onblur)用法笔记
- 史上最简单的 MySQL 教程(三十五)「数据备份与还原(上)」
- 苹果收购的这家法国计算机视觉公司,可通过AI来确定性别、年龄、情感
- 20年后的iphoneXXXX手机长这样
- SpaceX发布震撼宣传片:坐火箭出行 纽约到上海仅需半小时
- PAT 甲级 1056. Mice and Rice (25)
- hadoop源码
- hihocoder#1239 : Fibonacci(递推DP)
- 解析php中die(),exit(),return的区别
- 51nod 1043 幸运号码
- Parallel复制虚拟机之网卡配置
- 查看MySQL版本号的四种方式
- 个人网站上线的经历
- LeetCode#654 Maximum Binary Tree题解(C++版)