银行模拟 严蔚敏C版

 

typedef    struct
{

    int    time;                                                /*    type=1 入列1, type=2 出列1, type=3 出列3     */
    int    type;

}Event;                                                  /*    事件类型    */

 

 

 

 

typedef    struct    LNode
{

    Event   data;
    struct  LNode   *next;

}LNode, *ListPtr;                                            /*    结点类型,  指针类型    */

 

 

 

 

 

 

typedef    struct
{

    ListPtr    head;

}LinkList;                                                       /*    链表类型, 链表有头结点   */

 

 

 

 

 

typedef    struct
{

    int    ArriveTime;
    int    ServiceTime;
    int    Cash;

}Customer;                                                         /*   顾客类型    */

 

 

 

typedef    struct    QNode
{

    Customer    data;
    struct  QNode    * next;

}QNode,  *QueuePtr;                                                 /*    结点和指针    */

 

 

 

 

typedef    struct
{

    QueuePtr    front;
    QueuePtr    rear;
    int    length;
                                                                      /*    队列类型    */
}LinkQueue;

 

 

 

 

 

Event   event;
LinkList    evenlist;
Customer    customer;
LinkQueue   q[2];
int    TotalTime,  CustomerNum;
int    TotalCash=10000;
int    CloseTime=600;
                                                                         /*     全局变量    */

 

 

 

/*    以下是链表函数实现    */

 

void    InitList( LinkList  &L )                                             /*    初始化链表   */
{
   
    L.head=( ListPtr )malloc( sizeof( LNode ) );
    if( !L.head )     exit( -1 );
    L.head->next= NULL;

}

 

 

 

 

 

 

void    OrderInsert( LinkList  &L, Event  e )                                /*    根据事件发生的时间把事件插入事件表   */
{

    ListPtr  p,q,pre;
    p=( ListPtr )malloc( sizeof( LNode ) );
    if( !p )    exit( -1 );
    p->data=e;
    q=L.head->next;
    while( q!=NULL && ( q.data ).time<  ( p.data ).time )
    {

        pre=q;
        q=q->next;

    }
    p->next=q;
    pre->next=p;

}

 

 

 

 

 

 

 

void    DelFirst( LinkList  &L, Event  &e )                          /*    把正发生事件从事件表中删除   */
{

    ListPtr  p;
    p=L.head->next;
    if( p==NULL )    exit( -1 );
    L.head->next=p->next;
    e=p->data;
    free( p );

}

 

 

 

 

 

 

 

/*    以下是队列函数的实现    */

 

 

 

                                                                               /*   初始化队列  */
void    InitQueue( LinkQueue  &Q)
{

    Q.front=Q.rear=( QueuePtr )malloc( sizeof( QNode ) );
    if( !Q.front )    exit( -1 );
    Q.front->next=NULL;
    Q.length=0;

}

 

 

 

 

 

 

 

void    EnQueue( LinkQueue  &Q,  Customer  e )                              /*    插入队列  */
{

    QueuePtr  p;
    p=( QueuePtr )malloc( sizeof( QNode ) );
    if( !p )    exit( -1 );
    p->data=e;
    p->next=NULL;
    Q.rear->next=p;
    Q.rear=p;
    Q.length++;

}

 

 

 

 

 

 

 

void    DeQueue( LinkQueue  &Q,  Customer  &e )                          /*    元素出列    */
{

    QueuePtr  p;
    if( Q.length==0 )    exit( -1 );
    p=Q.front->next;
    Q.front->next=p->next;
    Q.length--;
    e=p->data;
    if( p==Q.rear )   Q.rear=Q.front;
    free( p );

}

 

 

 

 

 

 

void    GetHead( LinkQueue  &Q,  Customer  &e )                          /*    取头元素    */
{

    QueuePtr  p;
    if( Q.lengeh==0 )   exit( -1 );
    p=Q.front->next;
    e=p->data;

}

 

 

 

 

 

 

 

 

void    OpenForDay()                                                    /*    银行模拟初始化    */
{

    TotalTime=0;
    CustomerNum=0;
    event.time=0;
    event.type=1;
    InitList( eventlist );
    OrderInsert( eventlist,  event );
    for( i=1; i<=4; i++ )
    {

        InitQueue( q[i] );

    }

}

 

 

 

 

 

 

void    CustomerArrived()                                                            /*    客户入队    */
{

    int  servicetime,  intertime,  cash;

    ++CustomerNum;

    srand( time( 0 ) );
    servicetime = 3 + rand()%7;
    intertime = 5 + rand()%10;
    cash = -5000 + rand()%10000;

    EnQueue( q[0], ( event.time, servicetime,  cash ) );
    if( q[0].length==1 )
    {

        if( TotalCash + cash >= 0 )
        {

            OrderInsert( eventlist,  ( event.time + servicetime,  2 ) );
        }
        else
        {

            DeQueue( q[0], e );
            EnQueue( q[1], e );

        }
    }

    t=event.time + intertime;
    if( t< CloseTime )
    {
        OrderInsert( eventlist,  ( t,  1 ) );

    }

}

 

 

 

 

 

 

 

void    CustomerDepature_Q1()        /*    队列1中顾客出队    */
{

    int  TempCash;
    int  t,  servicetime;
    int  count;
    Customer  e,  next_customer;

    DeQueue( q[0],  customer );
    TotalTime += ( event.time - customer.ArriveTime );
    TempCash = TotalCash;
    TotalCash += customer.Cash;
    t=event.time;

    if( customer.Cash > 0 )                                                        /*   有人注资, 检查队列2    */
    {

        count=1;
        while( TotalCsah > TempCash && count <= q[1].length )
        {

            GetHead( q[1], e );
            if( TotalCash + e.Cash >= 0 )
            {

                TotalCash += e.Cash;
                srand( time( 0 ) );
                servicetime = 3 + rand()%7;
                t += servicetime;
                OrderInsert( eventlist, ( t, 3 ) );

            }
            else
            {

                DeQueue( q[1], e );
                EnQueue( q[1], e );

            }
            count++;

       }
    }

    if( q[0].length != 0 )
    {

        GetHead( q[0], next_customer );
        if( TotalCash + next_customer.Cash >=0 )
        {

            OrderInsert( eventlist,  ( t + next_customer.ServiceTime,  2 ) );

        }
        else
        {

            DeQueue( q[0], next_customer );
            EnQueue( q[1], next_customer );

        }

    }

 

}

 

 

void    CustomerDepature_Q2()        /*    队列2中顾客出队    */
{

    Customer  customer;

    DeQueue( q[1],  customer );
    TotalTime += ( event.time - customer.ArriveTime );

}

 

 

 

 

 

 

 

int    main()
{

    OpenForDay();
    while( eventlist.head->next != NULL )
    {

        DelFirst( eventlist,  event );
        switch ( event.type )
        {

            case 1 :    CustomerArrived();

            case 2 :    CustomerDepature_Q1();

            case 3 :    CustomerDepature_Q2();

            default :    exit( -1 );

        }

   }
   printf( "Average Time: %f ", ( float )TotalTime/CustomerNum );
   return  0;

}