#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX 2 /*車庫(kù)容量*/
#define price 0.05 /*每車每分鐘費(fèi)用*/

typedef struct time{
  int hour;
  int min;
}Time; /*時(shí)間結(jié)點(diǎn)*/

typedef struct node{
  char num[10];
  Time reach;
  Time leave;
}CarNode; /*車輛信息結(jié)點(diǎn)*/

typedef struct NODE{
  CarNode *stack[MAX+1];
  int top;
}SeqStackCar; /*模擬車站*/

typedef struct car{
  CarNode *data;
  struct car *next;
}QueueNode;

typedef struct Node{
  QueueNode *head;
  QueueNode *rear;
}LinkQueueCar; /*模擬通道*/

void InitStack(SeqStackCar *); /*初始化棧*/ 
int InitQueue(LinkQueueCar *); /*初始化便道*/
int Arrival(SeqStackCar *,LinkQueueCar *); /*車輛到達(dá)*/ 
void Leave(SeqStackCar *,SeqStackCar *,LinkQueueCar *); /*車輛離開(kāi)*/
void List(SeqStackCar,LinkQueueCar); /*顯示存車信息*/ 

void main()
{SeqStackCar Enter,Temp;
  LinkQueueCar Wait;
  int ch;
  InitStack(&Enter); /*初始化車站*/ 
  InitStack(&Temp); /*初始化讓路的臨時(shí)棧*/
  InitQueue(&Wait); /*初始化通道*/
  while(1)
  { printf("\n1. 車輛到達(dá)");
    printf(" 2. 車輛離開(kāi)");
    printf(" 3. 列表顯示");
    printf(" 4. 退出系統(tǒng)\n");
  while(1)
  {scanf("%d",&ch);
    if(ch>=1&&ch<=4)break;
    else printf("\n請(qǐng)選擇： 1|2|3|4.");
  }
  switch(ch)
  { case 1:Arrival(&Enter,&Wait);break; /*車輛到達(dá)*/
    case 2:Leave(&Enter,&Temp,&Wait);break; /*車輛離開(kāi)*/
    case 3:List(Enter,Wait);break; /*列表打印信息*/
    case 4:exit(0); /*退出主程序*/
    default: break;
}}}

void InitStack(SeqStackCar *s) /*初始化棧*/ 
{ int i;
  s->top=0;
  for(i=0;i<=MAX;i++)
  s->stack[s->top]=NULL;}

int InitQueue(LinkQueueCar *Q) /*初始化便道*/
  {Q->head=(QueueNode *)malloc(sizeof(QueueNode));
  if(Q->head!=NULL)
  {Q->head->next=NULL;
  Q->rear=Q->head;
  return(1);}
  else return(-1);}

void PRINT(CarNode *p,int room) /*打印出站車的信息*/ 
{int A1,A2,B1,B2;
  printf("\n請(qǐng)輸入離開(kāi)的時(shí)間:/**:**/");
  scanf("%d:%d",&(p->leave.hour),&(p->leave.min));
  printf("\n離開(kāi)車輛的車牌號(hào)為:");
  puts(p->num);
  printf("\n其到達(dá)時(shí)間為: %d:%d",p->reach.hour,p->reach.min);
  printf("離開(kāi)時(shí)間為: %d:%d",p->leave.hour,p->leave.min);
  A1=p->reach.hour;
  A2=p->reach.min;
  B1=p->leave.hour;
  B2=p->leave.min;
  printf("\n應(yīng)交費(fèi)用為: %2.1f元",((B1-A1)*60+(B2-A2))*price);
  free(p);
}

int Arrival(SeqStackCar *Enter,LinkQueueCar *W) /*車輛到達(dá)*/ 
  { CarNode *p;
  QueueNode *t;
  p=(CarNode *)malloc(sizeof(CarNode));
  flushall();
  printf("\n請(qǐng)輸入車牌號(hào)(例:陜A1234):");
  gets(p->num);
  if(Enter->top<MAX) /*車場(chǎng)未滿，車進(jìn)車場(chǎng)*/
  {Enter->top++;
    printf("\n車輛在車場(chǎng)第%d位置.",Enter->top);
    printf("\n請(qǐng)輸入到達(dá)時(shí)間:/**:**/");
    scanf("%d:%d",&(p->reach.hour),&(p->reach.min));
    Enter->stack[Enter->top]=p;
    return(1);}
  else /*車場(chǎng)已滿，車進(jìn)便道*/
   { printf("\n該車須在便道等待!");
    t=(QueueNode *)malloc(sizeof(QueueNode));
    t->data=p;
    t->next=NULL; 
    W->rear->next=t;
    W->rear=t;
    return(1); }}

void Leave(SeqStackCar *Enter,SeqStackCar *Temp,LinkQueueCar *W)
{ /*車輛離開(kāi)*/
  int i, room;
  CarNode *p,*t;
  QueueNode *q;
  /*判斷車場(chǎng)內(nèi)是否有車*/
  if(Enter->top>0) /*有車*/ 
  { while(1) /*輸入離開(kāi)車輛的信息*/ 
  {printf("\n請(qǐng)輸入車在車場(chǎng)的位置/1--%d/：",Enter->top);
  scanf("%d",&room);
  if(room>=1&&room<=Enter->top) break;}
  while(Enter->top>room) /*車輛離開(kāi)*/
    {Temp->top++;
    Temp->stack[Temp->top]=Enter->stack[Enter->top];
    Enter->stack[Enter->top]=NULL;
    Enter->top--;
  } 
  p=Enter->stack[Enter->top];
  Enter->stack[Enter->top]=NULL;
  Enter->top--;
  while(Temp->top>=1)
  {Enter->top++;
    Enter->stack[Enter->top]=Temp->stack[Temp->top];
    Temp->stack[Temp->top]=NULL;
    Temp->top--;}
    PRINT(p,room);
  /*判斷通道上是否有車及車站是否已滿*/
  if((W->head!=W->rear)&&Enter->top<MAX) /*便道的車輛進(jìn)入車場(chǎng)*/
    { q=W->head->next;
    t=q->data;
    Enter->top++;
    printf("\n便道的%s號(hào)車進(jìn)入車場(chǎng)第%d位置.",t->num,Enter->top);
    printf("\n請(qǐng)輸入現(xiàn)在的時(shí)間/**:**/:");
    scanf("%d:%d",&(t->reach.hour),&(t->reach.min));
    W->head->next=q->next;
    if(q==W->rear) W->rear=W->head;
      Enter->stack[Enter->top]=t;
      free(q);}
    else printf("\n便道里沒(méi)有車.\n");}
  else printf("\n車場(chǎng)里沒(méi)有車."); /*沒(méi)車*/ }

void List1(SeqStackCar *S) /*列表顯示車場(chǎng)信息*/
{int i;
  if(S->top>0) /*判斷車站內(nèi)是否有車*/
    {printf("\n車場(chǎng):");
    printf("\n 位置 到達(dá)時(shí)間 車牌號(hào)\n");
    for(i=1;i<=S->top;i++)
      {printf(" %d ",i);
      printf("%d:%d ",S->stack[i]->reach.hour,S->stack[i]->reach.min);
      puts(S->stack[i]->num);}}
  else printf("\n車場(chǎng)里沒(méi)有車");}

void List2(LinkQueueCar *W) /*列表顯示便道信息*/
{ QueueNode *p;
p=W->head->next;
if(W->head!=W->rear) /*判斷通道上是否有車*/
{printf("\n等待車輛的號(hào)碼為:");
while(p!=NULL)
{puts(p->data->num);
p=p->next;}}
else printf("\n便道里沒(méi)有車."); }

void List(SeqStackCar S,LinkQueueCar W)
{int flag,tag;
  flag=1;
  while(flag)
    {printf("\n請(qǐng)選擇 1|2|3:");
    printf("\n1.車場(chǎng)\n2.便道\n3.返回\n");
  while(1)
  { scanf("%d",&tag);
    if(tag>=1||tag<=3) break;
    else printf("\n請(qǐng)選擇 1|2|3:");
  }
  switch(tag)
  {case 1:List1(&S);break;   /*列表顯示車場(chǎng)信息*/
    case 2:List2(&W);break;   /*列表顯示便道信息*/
    case 3:flag=0;break;
    default: break;  }}
}