1026. Table Tennis (30)

1026. Table Tennis (30)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

题意:当前没有vip用户的时候,普通用户按桌子号码从小到达的顺序依次就座

        当前有vip用户的时候,有vip桌子的时候,vip用户无需等待,按从小到达立即就座,如果没有vip专用桌子,将它看作普通用户就好了

题解:可以用队列模拟啊,一秒一秒的模拟,每次首先看vip能否进入vip桌子,然后在根据桌子号码从小到大模拟

trick: 当用户玩的超过2小时,要默认给他截断,当成2小时啊有木有!!!!!!!!!!!!

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>

using namespace std;

struct node{
    int arrive_time, serve_time;
    int id, play;
    bool operator<(const node & X) const{
        return arrive_time > X.arrive_time;
    }
}customer[10010];

struct table{
    int id, vip, cnt, finish_time;
    bool operator<(const table & X) const{
        if (vip == X.vip) return id < X.id;
        return vip > X.vip;
    }
};

int get_time(const string & str) {
    int total = 0;
    total = (str[6] - '0') * 10 + str[7] - '0';
    total += ((str[3] - '0') * 10 + str[4] - '0') * 60;
    total += ((str[0] - '0') * 10 + str[1] - '0') * 3600;
    return total;
}

void to_time(const int & x) {
    printf("%02d:%02d:%02d ", x / 3600, (x % 3600) / 60, x % 60);
}

bool cmp(const node & a, const node & b){
    if (a.serve_time == b.serve_time) return a.arrive_time < b.arrive_time;
    return a.serve_time < b.serve_time;
}

int main() {
    int n;
    scanf("%d", &n);

    priority_queue<node> ord, vip;
    for (int i = 0; i < n; ++i) {
        string str;
        int tag;
        cin >> str >> customer[i].play >> tag;
        if (customer[i].play > 120) customer[i].play = 120;
        customer[i].play *= 60;
        customer[i].arrive_time = get_time(str);
        customer[i].id = i;
        if (tag) vip.push(customer[i]);
        else ord.push(customer[i]);
    }
    node tmp = {22 * 60 * 60, 0, 0, 0};
    vip.push(tmp);
    ord.push(tmp);

    int k, m;
    scanf("%d%d", &k, &m);
    vector<table> Table;
    for (int i = 0; i < k; ++i) {
        table tmp = {i, 0, 0, 0};
        Table.push_back(tmp);
    }
    for (int i = 0; i < m; ++i) {
        int id;
        scanf("%d", &id);
        Table[id - 1].vip = 1;
    }

    sort(Table.begin(), Table.end());
    int fp[110];

    for (int i = 0; i < k; ++i)
        fp[Table[i].id] = i;

    for (int cur_time = 8 * 60 * 60; cur_time < 21 * 60 * 60; ++cur_time) {
        while (vip.top().arrive_time <= cur_time) {
            int i;
            for (i = 0; i < m; ++i) {
                if (cur_time >= Table[i].finish_time) {
                    int id = vip.top().id;
                    vip.pop();
                    customer[id].serve_time = cur_time;
                    Table[i].finish_time = cur_time + customer[id].play;
                    Table[i].cnt++;
                    break;
                }
            }
            if (i == m) break;
        }
        for (int i = 0; i < k; ++i) {
            if (cur_time >= Table[fp[i]].finish_time) {
                int id;
                if (vip.top().arrive_time < ord.top().arrive_time) {
                    if (vip.top().arrive_time <= cur_time) {
                        id = vip.top().id;
                        vip.pop();
                    }
                    else 
                        continue;
                }
                else {
                    if (ord.top().arrive_time <= cur_time) {
                        id = ord.top().id;
                        ord.pop();
                    }
                    else 
                        continue;
                }

                customer[id].serve_time = cur_time;
                Table[fp[i]].finish_time = cur_time + customer[id].play;
                Table[fp[i]].cnt++;
            }
        }
    }

    sort(customer, customer + n, cmp);

    for (int i = 0; i < n; ++i) {
        if (customer[i].serve_time == 0) continue;
        to_time(customer[i].arrive_time);
        to_time(customer[i].serve_time);
        printf("%d\n", (customer[i].serve_time - customer[i].arrive_time + 30) / 60);
    }

    int num[110];
    for (int i = 0; i < k; ++i)
        num[Table[i].id] = Table[i].cnt;

    for (int i = 0; i < k; ++i)
        printf("%d%c", num[i], i == k - 1 ? '\n' : ' ');

    return 0;
}