PAT1026

题目链接：http://pat.zju.edu.cn/contests/pat-a-practise/1026

注意几点：1.21点包括21点来的都不给服务。 2.最多玩2小时    

特别注意几点： 1.if there are some tables open when they arrive, they will be assigned to the available table with the smallest number. 与  if when it is the turn of a VIP pair, yet no VIP table is available, they can be assigned as any ordinary players.  就是当有普通桌子 和  vip桌子同时 空闲时， vip优先选vip桌子！

2.   The waiting time must be rounded up to an integer minute(s).   这里指的四舍五入（最后一个case就是这个坑）。3.注意处理关了门，但是还没玩完的。

#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;

struct Players
{
    string arrivetime;
    string servingtime;
    int playingtime;
    int vip;
};

struct Tables
{
    int vip;
    int servednums;
    queue<Players> table;
}t1={0,0};

bool comp(Players p1, Players p2)
{
    if(p1.arrivetime < p2.arrivetime)
        return true;
    else
        return false;
}

bool comp1(Players p1, Players p2)
{
    if(p1.servingtime < p2.servingtime)
        return true;
    else
        return false;
}

int date2second(string end, string start)
{
    int hh(0), mm(0), ss(0);
    for(int i=0; i<3; ++i)
         if(i == 0)     
         { 
             ss = (end[6]-start[6])*10 + (end[7]-start[7]);
             if(ss < 0 )
             {--mm; ss +=60;}
         }
         else if(i == 1)
         {
             mm += (end[3]-start[3])*10 + (end[4]-start[4]);
             if(mm < 0)
                 {--hh; mm+=60;}        
         }
         else
             hh +=  (end[0]-start[0])*10 + (end[1]-start[1]);
    int sec = hh*3600+mm*60+ss;
    if(sec%60 == 0)
        return sec/60;
    else if(sec%60 >= 30)
        return sec/60 +1;
    else
        return sec/60;
    /*两个时间点之间差的时间, sec秒数*/
}

/*时间加1秒 然后返回string*/
string plus1ss(string s)
{
    s[7] = (char)((s[7]-'0'+1) + '0');
    if(s[7] > '9')
    {
        s[7] ='0';
        s[6] = (char)((s[6]-'0'+1) + '0');
    }
    if(s[6] == '6')
    {
        s[6] = '0';
        s[4] = (char)((s[4]-'0'+1) + '0');
    }
    if(s[4] > '9')
    {
        s[4] ='0';
        s[3] = (char)((s[3]-'0'+1) + '0');
    }
    if(s[3] == '6')
    {
        s[3] = '0';
        s[1] = (char)((s[1]-'0'+1) + '0');
    }
    if(s[1] > '9')
    {
        s[1] = '0';
        s[0] = (char)((s[0]-'0'+1) + '0');
    }
    return s;
}

int main()
{
    int N;
    while(cin>>N)
    {
        queue<Players> ordinary;
        queue<Players> vip;
        vector<Players> temp;
        for(int i=0; i<N; ++i)
        {
            string at; int pt, tag;
            cin>>at>>pt>>tag;
            if(at < "21:00:00" && at >= "08:00:00")
            {
                if(pt > 120)
                    pt = 120*60;
                else
                    pt = pt*60;
                Players p={at, "", pt, tag};
                temp.push_back(p);
            }
        }
        sort(temp.begin(), temp.end(), comp);
        for(int i=0; i<temp.size(); ++i)
            if(temp[i].vip == 0)
                ordinary.push(temp[i]);
            else
                vip.push(temp[i]);
        int K, M; cin>>K>>M;
        vector<Tables> tb(K, t1);

        for(int i=0; i<M; ++i)
        {
            int a; cin>>a;
            tb[a-1].vip = 1;
        }
        temp.clear();
        string time("08:00:00");
        while(time < "21:00:00" )
        {
            /*先遍历下，给vip分配桌子*/
            for(int i=0; i<tb.size(); ++i)
                if(tb[i].table.empty() && tb[i].vip == 1 && !vip.empty() && vip.front().arrivetime <= time)
                {
                    vip.front().servingtime = time;
                    tb[i].table.push(vip.front());
                    vip.pop();
                }
            /*普通分配*/
            for(int i=0; i<tb.size(); ++i)
                if(tb[i].table.empty())
                    if(!vip.empty() && !ordinary.empty())
                    {
                        if(vip.front().arrivetime < ordinary.front().arrivetime && vip.front().arrivetime <= time)
                        {
                                vip.front().servingtime = time;
                                tb[i].table.push(vip.front());
                                vip.pop();
                        }
                        else if(ordinary.front().arrivetime <= time)
                        {
                                ordinary.front().servingtime = time;
                                tb[i].table.push(ordinary.front());
                                ordinary.pop();
                        }
                    }
                    else if(vip.empty() && !ordinary.empty())
                    {
                        if(ordinary.front().arrivetime <= time)
                            {
                                 ordinary.front().servingtime = time;
                                tb[i].table.push(ordinary.front());
                                ordinary.pop();
                            }
                    }
                    else if(!vip.empty() && ordinary.empty())
                    {
                        if(vip.front().arrivetime <= time)
                            {
                                vip.front().servingtime = time;
                                tb[i].table.push(vip.front());
                                vip.pop();
                            }
                    }
            time = plus1ss(time);
            for(int i=0; i<tb.size(); ++i)
                if(!tb[i].table.empty())
                    if(--tb[i].table.front().playingtime == 0)
                    {
                        temp.push_back(tb[i].table.front());
                        tb[i].table.pop();
                        ++tb[i].servednums;
                    }
        }
        /*处理关了门，但是还没玩完的*/
        for(int i=0; i<tb.size(); ++i)
            if(!tb[i].table.empty())
            {    
                temp.push_back(tb[i].table.front());
                ++tb[i].servednums;
            }
        sort(temp.begin(), temp.end(), comp1);
        for(int i=0; i<temp.size(); ++i)
            cout<<temp[i].arrivetime<<" "<<temp[i].servingtime<<" "
            <<date2second(temp[i].servingtime, temp[i].arrivetime)<<endl;
        for(int i=0; i<tb.size()-1; ++i)
            cout<<tb[i].servednums<<" ";
        cout<<tb[tb.size()-1].servednums<<endl;
    }
    return 0;
}