POJ 3125 Printer Queue 数据结构 队列
来源:互联网 发布:视频头像替换软件 编辑:程序博客网 时间:2024/04/30 13:21
Printer Queue
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4329 Accepted: 2269
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
Source
Northwestern Europe 2006
inline快const快 tle------>0ms
ACcode
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int maxn=102;inline int aabs(int a){ return a<0?-a:a;}int a[maxn],st,ed;int main(){ int loop; scanf("%d",&loop); while(loop--){ int num,pos; scanf("%d %d",&num,&pos); for(int i=0;i<num;++i)scanf("%d",&a[i]); a[pos]=-a[pos]; st=0; ed=num; int cns=0; while((ed+1)%maxn!=st){ int k=a[st]; st=(st+1)%maxn; bool flag=true; for(int i=st;i!=ed;i=(i+1)%maxn) if(aabs(a[i])>aabs(k)){ flag=false; a[ed]=k; ed=(ed+1)%maxn; break; } if(flag){ cns++; if(k<0){ printf("%d\n",cns); break; } } } } return 0;}
0 0
- POJ 3125 Printer Queue 数据结构 队列
- POJ 3125 Printer Queue 模拟队列
- poj 3125 Printer Queue (队列)
- poj 3125 Printer Queue
- POJ 3125 Printer Queue
- Printer Queue(poj 3125)
- 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(用队列模拟过程)
- queue队列-printer queue
- POJ 3125 Printer Queue 笔记
- POJ 3125 Printer Queue (priority queue)
- (队列的应用5.3.3)POJ 3125 Printer Queue(优先队列的使用)
- Printer Queue打印队列
- 2005-2006 ACM-ICPC East Central North America Regional Contest (ECNA 2005) F.Square Count
- HDU 1160 FatMouse's Speed
- 对于集合的选择
- ACdream 1125(ACfun-字典序)
- hdu3468 Treasure Hunting 二分匹配
- POJ 3125 Printer Queue 数据结构 队列
- 判断程序编译方式
- 高性能Mysql系列一_架构篇
- NetBeans配置Xdebug 远程调试PHP
- ios输出整数占位符
- Jboss配置&应用部署错误信息记录
- 配置servlet连接池
- 火云开发课堂 - 《使用Cocos2d-x 开发3D游戏》系列 第四节:3D公告板
- Python3与Python2的区别