poj 3125 Printer Queue
来源:互联网 发布:屏蔽阿里云开机广告 编辑:程序博客网 时间:2024/04/30 11:46
Description
The only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in the printer queue and you may have to wait for hours to get a single page of output.
Because some jobs are more important than others, the Hacker General has invented and implemented a simple priority system for the print job queue. Now, each job is assigned a priority between 1 and 9 (with 9 being the highest priority,
and 1 being the lowest), and the printer operates as follows.
Your problem with the new policy is that it has become quite tricky to determine when your print job will actually be completed. You decide to write a program to figure this out. The program will be given the current queue (as a list of priorities) as well as the position of your job in the queue, and must then calculate how long it will take until your job is printed, assuming that no additional jobs will be added to the queue. To simplifymatters, we assume that printing a job always takes exactly one minute, and that adding and removing jobs from the queue is instantaneous.
Because some jobs are more important than others, the Hacker General has invented and implemented a simple priority system for the print job queue. Now, each job is assigned a priority between 1 and 9 (with 9 being the highest priority,
and 1 being the lowest), and the printer operates as follows.
- The first job J in queue is taken from the queue.
- If there is some job in the queue with a higher priority than job J, thenmove J to the end of the queue without printing it.
- Otherwise, print job J (and do not put it back in the queue).
Your problem with the new policy is that it has become quite tricky to determine when your print job will actually be completed. You decide to write a program to figure this out. The program will be given the current queue (as a list of priorities) as well as the position of your job in the queue, and must then calculate how long it will take until your job is printed, assuming that no additional jobs will be added to the queue. To simplifymatters, we assume that printing a job always takes exactly one minute, and that adding and removing jobs from the queue is instantaneous.
Input
One line with a positive integer: the number of test cases (at most 100). Then for each test case:
- One line with two integers n and m, where n is the number of jobs in the queue (1 ≤ n ≤ 100) and m is the position of your job (0 ≤ m ≤ n −1). The first position in the queue is number 0, the second is number 1, and so on.
- One linewith n integers in the range 1 to 9, giving the priorities of the jobs in the queue. The first integer gives the priority of the first job, the second integer the priority of the second job, and so on.
Output
For each test case, print one line with a single integer; the number of minutes until your job is completely printed, assuming that no additional print jobs will arrive.
Sample Input
31 054 21 2 3 46 01 1 9 1 1 1
Sample Output
125
这是一道模拟题,模拟队列即可;
难点在于如何实现将最高优先级之前的添加到队尾;
但当把思路转换一下,参照循环队列,这个问题就可以顺利解决了;
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>using namespace std;int main(){ int example; scanf("%d",&example); int n,m,s[101]; while(example--) { int time=0; scanf("%d %d",&n,&m); int first=0,finish=0,cur=0; for(int i=0;i<n;++i) { scanf("%d",&s[i]); } int max_priority; while(1) { max_priority=s[first]; //实现队列的循环 for(cur=(first+1)%n;cur!=first;cur=(cur+1)%n) { //寻找最高优先级 if(s[cur]>max_priority) { max_priority=s[cur]; finish=cur; } } if(finish==m){++time;break;} //调正优先级和头指针 else {s[finish]=0;finish=(finish+1)%n;first=finish;++time;} } printf("%d\n",time); } return 0;}
0 0
- poj 3125 Printer Queue
- POJ 3125 Printer Queue
- Printer Queue(poj 3125)
- poj 3125 Printer Queue
- POJ 3125 Printer Queue
- POJ 3125 Printer Queue 笔记
- POJ 3125 Printer Queue (priority queue)
- POJ 3125 Printer Queue 模拟队列
- poj 3125 Printer Queue (队列)
- POJ 3125 Printer Queue(单链表)
- POJ 3125 Printer Queue 数据结构 队列
- poj 3125.Printer Queue
- POJ 3125 && Sicily 1443 Printer Queue(模拟/队列)
- POJ 3125 && Sicily 1443 Printer Queue(模拟/队列)
- POJ 3125 Printer Queue【简单模拟a打印队列】
- POJ 3125 Printer Queue(打印队列---模拟)
- POJ 3125 Printer Queue(用队列模拟过程)
- Printer Queue
- 设计三层异常如何处理?
- NYOJ:题目57 6174问题
- sphinx-for-python
- android selector 中的item属性
- RecyclerView.ItemDecoration 使用总结
- poj 3125 Printer Queue
- 51nod 1154回文串划分 dp+递推
- 使用CURL调用接口[*示例*]
- Python 初学者的最佳学习资源
- Spring Boot 动态数据源(多数据源自动切换)
- FAT文件系统原理
- 12306的变态验证码算得了什么?我有Python神器!
- 【C#】30. VS 2015 的 C# 交互窗口(interactive window)
- poj 2991crane