2024-11-06 21:04:37 +00:00
|
|
|
struct station* create_station(){
|
|
|
|
struct station* station = (struct station*)calloc(1,sizeof(struct station));
|
|
|
|
station->tracks = (struct car**)calloc(STATION_SIZE, sizeof(struct car*));
|
|
|
|
station->track_count = STATION_SIZE;
|
|
|
|
return station;
|
|
|
|
}
|
2024-10-28 17:01:03 +00:00
|
|
|
|
2024-11-06 21:04:37 +00:00
|
|
|
void destroy_station(struct station* station){
|
|
|
|
free(station->tracks);
|
|
|
|
free(station);
|
|
|
|
}
|
2024-10-28 17:01:03 +00:00
|
|
|
|
2024-11-06 21:04:37 +00:00
|
|
|
int select_track(struct station* station, const char* target)
|
|
|
|
{
|
|
|
|
int i=0;
|
|
|
|
char t=0;
|
|
|
|
while(target[i]!=0)
|
|
|
|
{
|
2024-11-06 21:05:21 +00:00
|
|
|
t+=target[i];
|
2024-11-06 21:04:37 +00:00
|
|
|
}
|
|
|
|
if(t<0) {t=-t;}
|
|
|
|
|
2024-11-06 21:05:21 +00:00
|
|
|
i=t%10;
|
2024-11-06 21:04:37 +00:00
|
|
|
|
2024-11-06 21:05:21 +00:00
|
|
|
|
|
|
|
|
|
|
|
return i;
|
2024-11-06 21:04:37 +00:00
|
|
|
}
|
2024-10-28 17:01:03 +00:00
|
|
|
|
2024-11-06 21:04:37 +00:00
|
|
|
void add_target_capacity(struct station* station,const char* target, int capacity)
|
|
|
|
{
|
|
|
|
int i=select_track(station, target);
|
2024-10-28 17:01:03 +00:00
|
|
|
|
2024-11-06 21:04:37 +00:00
|
|
|
struct car *nwcar = (struct car*)calloc(STATION_SIZE, sizeof(struct car));
|
|
|
|
nwcar->next=NULL;
|
|
|
|
strcpy(nwcar->value, target);
|
|
|
|
nwcar->capacity=capacity;
|
2024-10-28 17:01:03 +00:00
|
|
|
|
2024-11-06 21:04:37 +00:00
|
|
|
if(station->tracks[i]==NULL)
|
|
|
|
{
|
|
|
|
station->tracks[i]=nwcar;
|
|
|
|
}
|
2024-10-28 17:01:03 +00:00
|
|
|
|
2024-11-06 21:04:37 +00:00
|
|
|
struct car* start = station->tracks[i];
|
|
|
|
struct car* this = start;
|
|
|
|
while(this->next != NULL)
|
|
|
|
{
|
|
|
|
this=this->next;
|
|
|
|
}
|
|
|
|
this->next=nwcar;
|
|
|
|
}
|
2024-10-28 17:01:03 +00:00
|
|
|
|
2024-11-06 21:04:37 +00:00
|
|
|
int get_target_capacity(struct station* station,const char* target)
|
|
|
|
{
|
|
|
|
int i=select_track(station, target);
|
|
|
|
struct car* start = station->tracks[i];
|
|
|
|
struct car* this = start;
|
|
|
|
while(this != NULL)
|
|
|
|
{
|
|
|
|
if(strcmp(this->value , target)==0)
|
|
|
|
{
|
|
|
|
return this->capacity;
|
|
|
|
}
|
|
|
|
this=this->next;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2024-10-28 17:01:03 +00:00
|
|
|
|
2024-11-06 21:04:37 +00:00
|
|
|
int count_targets(struct station* station)
|
|
|
|
{
|
|
|
|
int k=0;
|
|
|
|
for (int i = 0 ; i< station->track_count; i++)
|
|
|
|
{
|
|
|
|
struct car* start = station->tracks[i];
|
|
|
|
struct car* this = start;
|
|
|
|
while(this != NULL)
|
|
|
|
{
|
|
|
|
k++;
|
|
|
|
this=this->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return k;
|
|
|
|
}
|
|
|
|
|
|
|
|
int count_capacity(struct station* station){
|
|
|
|
int k=0;
|
|
|
|
|
|
|
|
for (int i = 0 ; i< station->track_count; i++)
|
|
|
|
{
|
|
|
|
struct car* start = station->tracks[i];
|
|
|
|
struct car* this = start;
|
|
|
|
|
|
|
|
while(this != NULL)
|
|
|
|
{
|
|
|
|
k+=this->capacity;
|
|
|
|
this=this->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return k;
|
|
|
|
}
|
2024-10-28 17:01:03 +00:00
|
|
|
|
|
|
|
|