PAT (Advanced Level) 1026. Table Tennis (30)

情况比较多的模拟题。

交了50发的样子才AC......AC之后我的天空星星都亮了。

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<map>
#include<queue>
#include<vector>
using namespace std;

struct X
{
    int st,ml,len;
    bool tag;
}s[+];
int n,m,k;
bool flag[+],g[+];
int ans[+],w[+];
queue<int>P,V;

bool cmp(const X&a,const X&b) { return a.st<b.st; }
bool cmp2(const X&a,const X&b) { return a.ml<b.ml; }

void init()
{
    memset(ans,,sizeof ans);
    memset(flag,,sizeof flag);
    for(int i=;i<=;i++) w[i]=**;
}

void read()
{
    scanf("%d",&n);
    for(int i=;i<=n;i++)
    {
        int hh,mm,ss; scanf("%d:%d:%d",&hh,&mm,&ss);
        s[i].st=hh*+mm*+ss;
        scanf("%d",&s[i].len); s[i].len=min(*s[i].len,**);
        cin>>s[i].tag;
    }
    scanf("%d%d",&m,&k);
    for(int i=;i<=k;i++) {int id; cin>>id; flag[id]=;}
    sort(s+,s++n,cmp);
    s[].st=;
}

void work()
{
    int sz=,pre=;

    while()
    {
        if(sz==n) break;
        int MIN=;
        for(int i=;i<=m;i++) MIN=min(MIN,w[i]);

        for(int i=pre+;i<=n;i++)
        {
            if(s[i].st>MIN) break;
            if(s[i].tag==) P.push(i); else V.push(i); pre=i;
        }

        memset(g,,sizeof g);
        for(int i=;i<=m;i++) if(w[i]==MIN) g[i]=;

        if(P.empty()&&V.empty())
        {
            sz++; pre++;int Find=;
            if(s[pre].tag==)
            {
                for(int i=;i<=m;i++)
                    if(flag[i]==&&w[i]<=s[pre].st)
                    {
                        w[i]=s[pre].st+s[pre].len;
                        s[pre].ml=s[pre].st; Find=;
                        if(s[pre].ml<**) ans[i]++;
                        break;
                    }
                if(Find==) continue;
                for(int i=;i<=m;i++)
                    if(flag[i]==&&w[i]<=s[pre].st)
                    {
                        w[i]=s[pre].st+s[pre].len;
                        s[pre].ml=s[pre].st; Find=;
                        if(s[pre].ml<**) ans[i]++;
                        break;
                    }
            }
            else
            {
                for(int i=;i<=m;i++)
                    if(w[i]<=s[pre].st)
                    {
                        w[i]=s[pre].st+s[pre].len;
                        s[pre].ml=s[pre].st; Find=;
                        if(s[pre].ml<**) ans[i]++;
                        break;
                    }
            }
            continue;
        }

        while(!V.empty())
        {
            int fail=,id=V.front();
            for(int j=;j<=m;j++)
                if(flag[j]&&g[j])
                {
                    sz++;
                    s[id].ml=w[j];
                    w[j]=s[id].ml+s[id].len;
                    fail=; g[j]=; V.pop();
                    if(s[id].ml<**) ans[j]++;
                    break;
                }
            if(fail==) break;
        }

        while()
        {
            int tmp1=,tmp2=,id;
            if(P.empty()&&V.empty()) break;
            if(!P.empty()) tmp1=P.front(); if(!V.empty()) tmp2=V.front();
            if(s[tmp1].st<s[tmp2].st) id=tmp1; else id=tmp2;

            int fail=;
            for(int j=;j<=m;j++)
                if(g[j])
                {
                    sz++;
                    s[id].ml=w[j];
                    w[j]=s[id].ml+s[id].len;
                    fail=; g[j]=; if(s[id].tag==) P.pop(); else V.pop();
                    if(s[id].ml<**) ans[j]++;
                    break;
                }
            if(fail==) break;
        }
    }
}

void prin()
{
    sort(s+,s++n,cmp2);
    for(int i=;i<=n;i++)
    {
        if(s[i].ml>=**) continue;

        int fen=(s[i].ml-s[i].st+)/;

        printf("%02d:",s[i].st/); s[i].st=s[i].st-s[i].st/*;
        printf("%02d:",s[i].st/); s[i].st=s[i].st-s[i].st/*;
        printf("%02d ",s[i].st);

        printf("%02d:",s[i].ml/); s[i].ml=s[i].ml-s[i].ml/*;
        printf("%02d:",s[i].ml/); s[i].ml=s[i].ml-s[i].ml/*;
        printf("%02d ",s[i].ml);

        printf("%d\n",fen);
    }

    for(int i=;i<=m;i++)
    {
        printf("%d",ans[i]);
        if(i<m) printf(" ");
        else printf("\n");
    }
}

int main()
{
    init();
    read();
    work();
    prin();
    return ;
}