【PAT-A】1095. Cars on Campus (30)

---

Task

Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the number of cars parking on campus, and at the end of the day find the cars that have parked for the longest time period.

Input Specification:

Each input file contains one test case. Each case starts with two positive integers N (<= 10000), the number of records, and K (<= 80000) the number of queries. Then N lines follow, each gives a record in the format

plate_number hh:mm:ss status

where plate_number is a string of 7 English capital letters or 1-digit numbers; hh:mm:ss represents the time point in a day by hour:minute:second, with the earliest time being 00:00:00 and the latest 23:59:59; and status is either in or out.

Note that all times will be within a single day. Each “in” record is paired with the chronologically next record for the same car provided it is an “out” record. Any “in” records that are not paired with an “out” record are ignored, as are “out” records not paired with an “in” record. It is guaranteed that at least one car is well paired in the input, and no car is both “in” and “out” at the same moment. Times are recorded using a 24-hour clock.

Then K lines of queries follow, each gives a time point in the format hh:mm:ss. Note: the queries are given in ascending order of the times.

Output Specification:

For each query, output in a line the total number of cars parking on campus. The last line of output is supposed to give the plate number of the car that has parked for the longest time period, and the corresponding time length. If such a car is not unique, then output all of their plate numbers in a line in alphabetical order, separated by a space.

Sample Input:

16 7
JH007BD 18:00:01 in
ZD00001 11:30:08 out
DB8888A 13:00:00 out
ZA3Q625 23:59:50 out
ZA133CH 10:23:00 in
ZD00001 04:09:59 in
JH007BD 05:09:59 in
ZA3Q625 11:42:01 out
JH007BD 05:10:33 in
ZA3Q625 06:30:50 in
JH007BD 12:23:42 out
ZA3Q625 23:55:00 in
JH007BD 12:24:23 out
ZA133CH 17:11:22 out
JH007BD 18:07:01 out
DB8888A 06:30:50 in
05:10:00
06:30:50
11:00:00
12:23:42
14:00:00
18:00:00
23:59:00

Sample Output:

1
4
5
2
1
0
1
JH007BD ZD00001 07:20:09

---

Main Idea

读取数据，转化为int,用Record数组存储

对车牌号进行排序，用这种方法对车牌号进行分组

qsort(Record, recordNumber,sizeof(Record[0]),cmpPlate);

根据上述的分组对每一辆车的记录进行处理

• 按时间点重新排序
• 用timeStatue数组记录有效的in&out记录(in&out 要有能一一对应，多次出现取有效的第一个)
• 判断是否停留时间最长，用链表存放

void countDuration(const int start, const int count)

考虑到 the queries are given in accending order of the times，结合timeStatue数组对请求作出反馈

void calculateNumber()；

最后进行输出并且释放指针

---

Code

//@Birdy&C
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int recordNumber, requreNumber;//the number of records, and  the number of queries.
const int max_recordNumber = 10001; //the max number of record
int timeStatue[86401] = { 0 }; //record the total statue in every seconds
int maxDuration = 0; //record the longest duration time

enum status_condition //the status of the record
{
    IN,//status is in
    OUT//status is out
};
struct Node {
    int index = 0;//record the index of cars in the list
    Node* next = NULL;//point to next node
}head;//record the car that has packed for the longest time
struct record{
    char plate_number[8]; //plate_number is a string of 7 English capital letters or 1-digit numbers
    int time;//represents the time point in a day ,similar to hour:minute:second
    status_condition status;//reprent the status,in & out
}Record[max_recordNumber];

int cmpPlate(const void *a, const void *b) {//sort in a decrease order because when save it into a list it is reversed
    return -strcmp(((record *)a)->plate_number, ((record *)b)->plate_number);
}
int cmpTime(const void *a, const void *b) {//sort in a accending order of time
    return ((record *)a)->time-((record *)b)->time;
}
void clear() //clear the list of car(s) staying longest
{
    Node* p,*p_temp;
    p = head.next;
    while (p != NULL) 
    {
        p_temp = p->next;
        free(p);//realse space
        p = p_temp;
    }
    head.next = NULL;
}
void insert(const int i) //record car with index i
{
    Node* pnode;
    pnode = (Node*)malloc(sizeof(struct Node));
    pnode->index = i;
    pnode->next = head.next;
    head.next = pnode;//insert it after head node
}

int getTime() 
{
    int hour, minute, second;
    scanf("%d:%d:%d", &hour, &minute, &second);//get the input
    return hour * 3600 + minute * 60 + second;//transfer it to integer

}

void countDuration(const int start, const int count) 
{
    int duration = 0;
    status_condition flag;//remember the status of the car
    int pre;
    int t;
    qsort(Record + start, count, sizeof(Record[0]), cmpTime);
    flag = OUT;
    for(int i = start; i < start + count; i++)
    {
         t = Record[i].time;
        if (IN == Record[i].status) 
        {
                flag = IN; //car is inside the campus
                pre = t;
        }
        else 
        {           
            if (OUT == flag) continue;//car is outside the campus,means in &out record are not paired
            timeStatue[pre]++; 
            duration -= pre;
            timeStatue[t]--;        
            duration += t;
            //printf("IN %d\n", pre);
            //printf("OUT %d\n", t);
            flag = OUT;
        }
    }
    if (duration > maxDuration) 
    {
        maxDuration = duration;//renew the maxDuration
        clear();//clear the record
        insert(start);//record the car
    }
    else if (duration == maxDuration)
    {
        insert(start);//record the car
    }
}

void calculateNumber() 
{
    {
        int count = 0;
        int time = 0, temp = 0;
        count = 0;//the number of cars in the campus
        time = temp = 0;
        for (int i = 0; i < requreNumber; i++) //deal with input of records
        {
            time = getTime();//get the input time
            while (temp <= time)
            {
                count += timeStatue[temp];
                temp++;
            }
            printf("%d\n", count);
        }
    }
}
void printMaxDuration() //out put the information of duration
{
    Node* p;
    p = head.next;
    while (p != NULL)
    {
        printf("%s ", Record[p->index].plate_number);//output the plate number of the car that has parked for the longest time period
        p = p->next;
    }
    printf("%02d:%02d:%02d", maxDuration / 3600, maxDuration / 60 % 60, maxDuration % 60);//output the corresponding time length.
}

int main(void) 
{
    scanf("%d %d", &recordNumber, &requreNumber);//get the number of records, and the number of queries.

    for (int i = 0; i < recordNumber; i++) //deal with input of records
    {
        scanf("%s", Record[i].plate_number);
        Record[i].time = getTime();//get the time point
        char status_temp[4];
        scanf("%s", status_temp);
        if (status_temp[0] == 'i') Record[i].status = IN;//if status is in 
        else Record[i].status = OUT;//if status is out
    }

    qsort(Record, recordNumber,sizeof(Record[0]),cmpPlate);//separte the record according to palte number

        int temp = 0;
        int count = 0;//count the number of record of a certain car
        char plate[8];//remember the plate number of the car
        while (temp < recordNumber)
        {
            count = 0;
            strcpy(plate, Record[temp].plate_number);
            while (0 == strcmp(plate, Record[temp].plate_number))//count the information of a certain car
            {
                temp++;
                count++;
            }
                countDuration(temp - count, count); //deal with the information
        }


    calculateNumber();  //calculate the total number of cars parking on campus 
    printMaxDuration(); //out put the information of duration
    clear();//realse the space
    system("pause");
    return 0;
}