1497.txt

杭电acm解题报告2001---2099.

#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;

int book[110000];
struct inf
{
    int bs;
    int bi[20];
}user[1100];
int m,n,c;
char op;

int main()
{
    int i,j,k;
    int ui,bi;

    while(scanf("%d %d %d",&m,&n,&c)==3)
    {
        memset(book,0,sizeof(book));
        memset(user,0,sizeof(user));

        for(k=0;k<c;k++)
        {
            getchar();
            op=getchar();

            switch(op)
            {
            case 'B':
                scanf("%d %d",&ui,&bi);
                if(book[bi]!=0)
                {
                    printf("The book is not in the library now\n");
                }
                else
                {
                    if(user[ui].bs>=9)
                        printf("You are not allowed to borrow any more\n");
                    else
                    {
                        book[bi]=ui;
                        user[ui].bs++;
                        user[ui].bi[ user[ui].bs ]=bi;
                        printf("Borrow success\n");
                    }

                }
                break;
            case 'R':
                scanf("%d",&bi);

                if(book[bi]==0)
                    printf("The book is already in the library\n");
                else
                {
                    ui=book[bi];
                    for(i=1;i<=user[ui].bs;i++)
                    {
                        if(user[ui].bi[i]==bi)
                        {
                            for(j=i+1;j<=user[ui].bs;j++)
                            {
                                user[ui].bi[ j-1 ]=user[ui].bi[ j ];
                            }
                            break;
                        }
                    }
                    user[ui].bs--;
                    book[bi]=0;
                    printf("Return success\n");
                }
                break;
            case 'Q':
                scanf("%d",&ui);
                if(user[ui].bs==0)
                    printf("Empty\n");
                else
                {
                    sort(user[ui].bi,user[ui].bi+user[ui].bs+1);
                    //printf("%d",user[ui].bs);
                    for(i=1;i<=user[ui].bs;i++)
                    {
                        if(i>1)
                            printf(" ");
                        printf("%d",user[ui].bi[i]);
                    }
                    printf("\n");
                }
                break;
            }
        }
        printf("\n");
    }
}