#include<stdio.h> 
#include<stdlib.h> 
#include<string.h> 
#define MAX 2 /*車庫容量*/ 
#define price 0.1 /*每車每分鐘費用*/
/*----------------------------------定義數據類型----------------------------------*/ 
/*時間結點*/  
typedef struct time{ 
  int hour; 
  int min; 
}Time; 
/*車輛信息結點*/
typedef struct node{ 
  char num[10]; 
  Time reach; 
  Time leave; 
}CarNode; 
/*模擬車站*/
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 *); /*車輛到達*/ 
void Leave(SeqStackCar *,SeqStackCar *,LinkQueueCar *); /*車輛離開*/ 
/*-------------------------------自定義函數-----------------------------------*/ 
/*初始化棧*/
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("\nplease input thedepart time:/**:**/"); 
    scanf("%d:%d",&(p->leave.hour),&(p->leave.min)); 
    printf("\nthe number of the car:"); 
    puts(p->num); 
    printf("\nthe time the car arrive: %d:%d",p->reach.hour,p->reach.min); 
    printf("the depart time: %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("\nthe fee: %2.1f元",((B1-A1)*60+(B2-A2))*price); 
    free(p); } 
 /*車輛到達*/
int Arrival(SeqStackCar *Enter,LinkQueueCar *W) 
{ 
    CarNode *p; 
    QueueNode *t; 
    p=(CarNode *)malloc(sizeof(CarNode)); 
    flushall(); 
    printf("input the number of the car:"); 
    gets(p->num); 
    if(Enter->top<MAX) /*車場未滿，車進車場*/ 
    { 
      Enter->top++; 
      printf("the place of the car: %d\n",Enter->top);
      printf("the time of thecar arrive:/**:**/"); 
      scanf("%d:%d",&(p->reach.hour),&(p->reach.min)); 
      Enter->stack[Enter->top]=p; 
      return(1); 
    } 
    else /*車場已滿，車進便道*/ 
    { 
      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) 
{  
	int  room; 
    CarNode *p,*t; 
    QueueNode *q; 
    /*判斷車場內是否有車*/ 
    if(Enter->top>0) /*有車*/
    { 
      while(1) /*輸入離開車輛的信息*/ 
      { 
        printf("\n請輸入車在車場的位置/1--%d/：",Enter->top); 
        scanf("%d",&room); 
        if(room>=1&&room<=Enter->top) break; 
      } 
      while(Enter->top>room) /*車輛離開*/ 
      { 
        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) /*便道的車輛進入車場*/ 
      { 
        q=W->head->next; 
        t=q->data; 
        Enter->top++; 
        printf("\n便道的%s號車進入車場第%d位置.",t->num,Enter->top); 
        printf("\n請輸入現在的時間/**:**/:"); 
        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便道里沒有車.\n"); 
    } 
    else printf("\n車場里沒有車."); /*沒車*/ } 
/*--------------------------------主函數-------------------------------------*/ 
void main() 
{
	SeqStackCar Enter,Temp; 
    LinkQueueCar Wait; 
    unsigned char ch; 
    InitStack(&Enter); /*初始化車站*/ 
    InitStack(&Temp); /*初始化讓路的臨時棧*/ 
    InitQueue(&Wait); /*初始化通道*/ 
    while(1) 
  { 
	printf("\n**********************************************");
	printf("\narrive(A)  "); 
    printf("  leave(D)  "); 
    printf("  quit(Q)\n"); 
    printf("**********************************************\n");
	printf("請選擇：");
     while(1) 
    { 
	  scanf("%c",&ch); 
	  if(ch==10)
      scanf("%c",&ch); 
	  if(ch=='A'||ch=='D'||ch=='Q')break; 
      else printf("輸入錯誤，請輸入A|D|Q\n"); 
    } 
    switch(ch) 
    { 
      case 'A':Arrival(&Enter,&Wait);break; /*車輛到達*/ 
      case 'D':Leave(&Enter,&Temp,&Wait);break; /*車輛離開*/ 
      case 'Q':exit(0); /*退出程序*/ 
      default: break;  
	}
	}  
}