PAT A1026 Table Tennis (30 分)——队列
A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they will be assigned to the available table with the smallest number. If all the tables are occupied, they will have to wait in a queue. It is assumed that every pair of players can play for at most 2 hours.
Your job is to count for everyone in queue their waiting time, and for each table the number of players it has served for the day.
One thing that makes this procedure a bit complicated is that the club reserves some tables for their VIP members. When a VIP table is open, the first VIP pair in the queue will have the priviledge to take it. However, if there is no VIP in the queue, the next pair of players can take it. On the other hand, if when it is the turn of a VIP pair, yet no VIP table is available, they can be assigned as any ordinary players.
Input Specification:
Each input file contains one test case. For each case, the first line contains an integer N
(≤10000) - the total number of pairs of players. Then N
lines follow, each contains 2 times and a VIP tag: HH:MM:SS
- the arriving time, P
- the playing time in minutes of a pair of players, and tag
- which is 1 if they hold a VIP card, or 0 if not. It is guaranteed that the arriving time is between 08:00:00 and 21:00:00 while the club is open. It is assumed that no two customers arrives at the same time. Following the players' info, there are 2 positive integers: K
(≤100) - the number of tables, and M
(< K) - the number of VIP tables. The last line contains M
table numbers.
Output Specification:
For each test case, first print the arriving time, serving time and the waiting time for each pair of players in the format shown by the sample. Then print in a line the number of players served by each table. Notice that the output must be listed in chronological order of the serving time. The waiting time must be rounded up to an integer minute(s). If one cannot get a table before the closing time, their information must NOT be printed.
Sample Input:
9
20:52:00 10 0
08:00:00 20 0
08:02:00 30 0
20:51:00 10 0
08:10:00 5 0
08:12:00 10 1
20:50:00 10 0
08:01:30 15 1
20:53:00 10 1
3 1
2
Sample Output:
08:00:00 08:00:00 0
08:01:30 08:01:30 0
08:02:00 08:02:00 0
08:12:00 08:16:30 5
08:10:00 08:20:00 10
20:50:00 20:50:00 0
20:51:00 20:51:00 0
20:52:00 20:52:00 0
3 3 2
#include <stdio.h>
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int maxn = ;
struct window {
int isvip=;
int count=;
int serve=*;
}win[maxn];
struct pairs {
int h;
int m;
int s;
int arrive;
int time;
int vip;
int wait;
int serve;
};
int n, k, m;
vector<pairs> v;
queue<pairs> q;
bool cmp(pairs p1, pairs p2) {
return p1.arrive < p2.arrive;
}
int main() {
scanf("%d", &n);
int flag = ;
for (int i = ; i < n; i++) {
pairs p;
scanf("%d:%d:%d %d %d", &p.h, &p.m, &p.s, &p.time, &p.vip);
p.arrive = p.h * + p.m * + p.s;
if (p.time > )p.time = ;
p.time *= ;
v.push_back(p);
if (p.vip == )flag++;
}
scanf("%d %d", &k, &m);
for (int i = ; i < m; i++) {
int j;
scanf("%d", &j);
win[j].isvip = ;
}
sort(v.begin(), v.end(), cmp);
for (int i = ; i < n; i++) {
if (v[i].arrive >= * )break;
int min = * ;
int min_j = ;
for (int j = ; j <= k; j++) {
if (win[j].serve < min) {
min = win[j].serve;
min_j = j;
}
}
if (min_j != ) {
if (v[i].arrive >= min) {
if (v[i].vip == ) {
int vip_j = ;
for (int j = ; j <= k; j++) {
if (win[j].serve <= v[i].arrive && win[j].isvip == ) {
vip_j = j;
break;
}
}
if (vip_j != ) {
win[vip_j].serve = v[i].arrive;
v[i].wait = ;
v[i].serve = win[vip_j].serve;
win[vip_j].serve += v[i].time;
win[vip_j].count++;
if (v[i].serve < * )q.push(v[i]);
}
else {
int vip_j = ;
for (int j = ; j <= k; j++) {
if (win[j].serve <= v[i].arrive) {
vip_j = j;
break;
}
}
if (vip_j != ) {
win[vip_j].serve = v[i].arrive;
v[i].wait = ;
v[i].serve = win[vip_j].serve;
win[vip_j].serve += v[i].time;
win[vip_j].count++;
if (v[i].serve < * )q.push(v[i]);
}
}
}
else {
int vip_j = ;
for (int j = ; j <= k; j++) {
if (win[j].serve <= v[i].arrive) {
vip_j = j;
break;
}
}
if (vip_j != ) {
win[vip_j].serve = v[i].arrive;
v[i].wait = ;
v[i].serve = win[vip_j].serve;
win[vip_j].serve += v[i].time;
win[vip_j].count++;
if (v[i].serve < * )q.push(v[i]);
}
}
}
else {
if (win[min_j].isvip == ) {
v[i].wait = (min - v[i].arrive) / + ((min - v[i].arrive) % >= ? : );
v[i].serve = win[min_j].serve;
win[min_j].serve += v[i].time;
win[min_j].count++;
if (v[i].serve < * )q.push(v[i]);
}
else {
int tmp_j = i;
for (tmp_j; tmp_j < n; tmp_j++) {
if (v[tmp_j].vip == && v[tmp_j].arrive <= min) {
pairs tmp_p2 = v[tmp_j];
v.erase(v.begin() + tmp_j);
v.insert(v.begin() + i, tmp_p2);
break;
}
}
v[i].wait = (min - v[i].arrive) / + ((min - v[i].arrive) % >= ? : );
v[i].serve = win[min_j].serve;
win[min_j].serve += v[i].time;
win[min_j].count++;
if (v[i].serve < * )q.push(v[i]);
}
}
}
else break;
}
while (!q.empty()) {
pairs qp = q.front();
q.pop();
printf("%02d:%02d:%02d %02d:%02d:%02d %d\n", qp.h, qp.m, qp.s, qp.serve / , qp.serve % / , qp.serve % % , qp.wait);
}
for (int i = ; i <= k; i++) {
printf("%d", win[i].count);
if (i != k)printf(" ");
}
system("pause");
}
注意点:测试点3是有一个21点来的人,题目说保证到达时间在8点到21点之间,没说是小于,有刚好等于的,坑。
测试点4是有人想打超过2个小时,题目说了只能打最多2小时。
还有就是如果到的时候有空位,不是去最早服务的那个,而是要去桌号最小的满足服务时间那个桌
最后一点,一开始觉得题目很复杂,其实只要一点点写,写着写着就做出来了。我是先写出如果没有vip这种情况,再考虑有vip的时候要怎么修改。
PAT A1026 Table Tennis (30 分)——队列的更多相关文章
- PAT 甲级 1026 Table Tennis (30 分)(坑点很多,逻辑较复杂,做了1天)
1026 Table Tennis (30 分) A table tennis club has N tables available to the public. The tables are ...
- 1026 Table Tennis (30分)
A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For a ...
- 1026 Table Tennis (30分) 难度不高 + 逻辑复杂 +细节繁琐
题目 A table tennis club has N tables available to the public. The tables are numbered from 1 to N. Fo ...
- PAT 1026 Table Tennis (30)
A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For a ...
- 【PAT甲级】1026 Table Tennis (30 分)(结构体排序,trick较多)
题意: 输入一个正整数N(<=10000),表示客户(对)的大小,接着输入N行数据,每行包括一对顾客到场的时间,想要玩的时间,以及是否是VIP客户.接下来输入两个正整数K,M(K<=100 ...
- PAT 1026 Table Tennis[比较难]
1026 Table Tennis (30)(30 分) A table tennis club has N tables available to the public. The tables ar ...
- 1026 Table Tennis (30)(30 分)
A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For a ...
- PAT甲级——A1026 Table Tennis
A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For a ...
- 1026. Table Tennis (30)
题目如下: A table tennis club has N tables available to the public. The tables are numbered from 1 to N. ...
随机推荐
- Java学习笔记之——静态方法
1.方法的定义 定义在类中,方法是独立的 2.语法: public static 返回值类型 方法名(形参列表){ 方法中的具体代码: } 1)方法名:在同一个类中方法名不能重复 命名规则:驼峰 ...
- minitab 转换语言
在使用minitab的时候,我们会以中文版熟悉界面,但是我们在实际操作的时候就要使用英文版的功能. 那么如何改变其语言环境呢. 很简单: 工具->选项->语言
- css3火焰文字样式代码
css样式: <style type="text/css"> body{background:#000;} *{margin:0;padding:0;transitio ...
- vue.js 键盘enter事件的使用
在监听键盘事件时,我们经常需要检查常见的键值.Vue 允许为 v-on 在监听键盘事件时添加按键修饰符: <!-- 只有在 `keyCode` 是 13 时调用 `vm.submit()` -- ...
- Spring Boot Actuator认识
概述 spring-boot-starter-actuator:是一个用于暴露自身信息的模块,主要用于监控与管理. 为了保证actuator暴露的监控接口的安全性,需要添加安全控制的依赖spring- ...
- Excel快捷键大全 Excel2013/2010/2007/2003常用快捷键大全
一个软件最大的用处是提高工作效率,衡量一个软件的好坏,除了是否出名之外,最主就是能否让一个新手更快的学会这个软件和提高工作速度.就拿Excel表格来说吧,平常办公中我们经常会用它来制作表格,统计数据或 ...
- Dos烧录脚本
Dos命令之前更改的太简单,现在加入判断是否进入fasboot模式和判断Android镜像是否存在:代码已经尽量简化成这样,dos命令功能还是比较不好用的,用了一下午的时间... @echo off ...
- momentjs 学习
momentjs 是一个JavaScript日期处理类库,官网地址:http://momentjs.com/ 字符串 + 格式 moment(String, String); moment(Strin ...
- js获取子节点和修改input的文本框内容
js获取子节点和修改input的文本框内容 js获取子节点: $("#"+defaultPVItemId).children().eq(3); //获取某个选择器下的第四个子节点 ...
- 03LaTeX学习系列之---TeXworks的使用
目录 03TeXworks的使用 目录 前言 (一)Texworks的认识 1.TeXworks的安装 2.TeXworks的优点 3.TeXworks的界面 (二)Texworks的编译与查看 1. ...