1434 幸福列车.cpp

威士忌的HDU题解.大概有260多题的源码。对于学习非常有好处。

/*
1434 幸福列车
Time Limit : 10000 ms  Memory Limit : 65535 K  Output Limit : 256 K

GUN C++
*/

#include<string.h>
#include<stdio.h>
char s[10001][101][21];
int car[10001],rp[10001][101];

int main()
{
  int i,j,k,l,m,n,min,flag,m1,m2,i2;
  char s2[22];

  while(scanf("%d%d",&n,&m)!=EOF)
  {
    for(i=1;i<=n;i++)
    {
        scanf("%d",&car[i]);
        for(j=1;j<=car[i];j++)
          scanf("%s %d",s[i][j],&rp[i][j]);
    }
    while(m--)
    {
        scanf("%s",s2);
        if(strcmp(s2,"GETOUT")==0)
        {
          scanf("%d",&k);
          min=rp[k][1];
          flag=1;
          for(i2=2;i2<=car[k];i2++)
          {
            if( min > rp[k][i2])
            {
                min=rp[k][i2];
                flag=i2;
            }
            else
            if( min == rp[k][i2] && strcmp(s[k][flag],s[k][i2])<0 )
                  flag=i2;
          }
          printf("%s\n",s[k][flag]);

            for(i2=flag;i2<car[k];i2++)
          {
            strcpy(s[k][i2],s[k][i2+1]);
            rp[k][i2]=rp[k][i2+1];
          }
          car[k]--;
        }
        else
        if(strcmp(s2,"GETON")==0)
        {
          scanf("%d%s%d",&k,s2,&m1);
          car[k]++;
          strcpy(s[k][ car[k] ],s2);
          rp[k][ car[k] ]=m1;

        }
        else
        if(strcmp(s2,"JOIN")==0)
        {
          scanf("%d%d",&m1,&m2);
          l=car[m1];
          for(i2=1;i2<=car[m2];i2++)
          {
            l++;
            strcpy(s[m1][l],s[m2][i2]);
            rp[m1][l]=rp[m2][i2];
          }
          car[m1]+=car[m2];
        }
    }
  } return 0;
}