/* * * * * * * * * * * * * * * * * * * * * * * * * *\
*             CS2310 Term Project                  *
*      Heuristic Time Scheduling Algorithm         *
*                 Yue Zhang                        *
*             zysxqn@cs.pitt.edu                   *
\* * * * * * * * * * * * * * * * * * * * * * * * * */

/* cpp file:HTSA.cpp */
/* implementation of heuristic time scheduling algorithm */

/*head file*/
#include "HTSA.h"
#include <iostream.h>
#include <fstream.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

char * STOP='\0';

/*define*/
#define DAY_START_TIME 800
#define DAY_END_TIME   1800

#define SPEED 2     //  KM/MINUTE

/*global varient*/
ifstream info;
int patient_no;
PATIENT *patient;
int nurse_no;
NURSE *nurse;
int max_no;   //max number of patients a nurse can serve within 1 day
int served_no=0;

/*function*/
int TravelTime(LOCATION l1, LOCATION l2)
{
	return (int)sqrt((l1.x-l2.x)*(l1.x-l2.x)+(l1.y-l2.y)*(l1.y-l2.y))/SPEED;
}

int Plus(int t1, int t2)
{
	int hour;
	int min;
	int c;
	hour=t1/100;
	min=t1%100;
	c=(min+t2)/60;
	min=(min+t2)%60;
	hour+=c;
	return hour*100+min;
}

int CanServe(NURSE n, PATIENT p)
{
	if(p.served)return 0;

	//check whether it's morning or afternoon
	if(n.current_time<n.init_schedule.FindSlot(REST).start_time)     //morning
	{
		//check whether n can arrive p before lunch
		if(Plus(n.current_time,TravelTime(n.current_location,p.location))>n.init_schedule.FindSlot(REST).start_time)
		{
			if(Plus(n.init_schedule.FindSlot(REST).end_time,TravelTime(n.current_location,p.location))>p.schedule.FindSlot(FREE).start_time)return 0;
		}
		//check whether can serve
		else
		{
			if(Plus(n.current_time,TravelTime(n.current_location,p.location))>p.schedule.FindSlot(FREE).start_time)return 0;
		}
	}
	else if(n.current_time<n.init_schedule.FindSlot(REST).end_time)  //lunch
	{
		if(Plus(n.init_schedule.FindSlot(REST).end_time,TravelTime(n.current_location,p.location))>p.schedule.FindSlot(FREE).start_time)return 0;
	}
	else          //afternoon
	{
		if(Plus(n.current_time,TravelTime(n.current_location,p.location))>p.schedule.FindSlot(FREE).start_time)return 0;
	}
	return 1;
}

int H(NURSE n, PATIENT p)
{
	return p.schedule.FindSlot(FREE).end_time;
}

void UpdateSchedule(NURSE &n, PATIENT &p)
{
	//check travel time
	if(n.current_time<n.init_schedule.FindSlot(REST).start_time)
	{
		if(Plus(n.current_time,TravelTime(n.current_location,p.location))>n.init_schedule.FindSlot(REST).start_time)
		{
			//travel after lunch rest

			//fill rest slot
			n.final_schedule.slot[n.final_schedule.slot_no].FillSlot(REST,n.current_time,n.init_schedule.FindSlot(REST).end_time,n.current_location,n.current_location);
			n.final_schedule.slot_no++;

			//fill travel slot
			n.final_schedule.slot[n.final_schedule.slot_no].FillSlot(TRAVEL,n.init_schedule.FindSlot(REST).end_time,Plus(n.init_schedule.FindSlot(REST).end_time,TravelTime(n.current_location,p.location)),n.current_location,p.location);
			n.final_schedule.slot_no++;

			//fill rest slot
			n.final_schedule.slot[n.final_schedule.slot_no].FillSlot(REST,Plus(n.init_schedule.FindSlot(REST).end_time,TravelTime(n.current_location,p.location)),p.schedule.FindSlot(FREE).start_time,p.location,p.location);
			n.final_schedule.slot_no++;

			//fill serve slot
			n.final_schedule.slot[n.final_schedule.slot_no].FillSlot(SERVE,p.schedule.FindSlot(FREE).start_time,p.schedule.FindSlot(FREE).end_time,p.location,p.location);
			n.final_schedule.slot_no++;

			return;
		}
	}
	//travel, then rest, then serve
			
	//fill travel slot
	n.final_schedule.slot[n.final_schedule.slot_no].FillSlot(TRAVEL,n.current_time,Plus(n.current_time,TravelTime(n.current_location,p.location)),n.current_location,p.location);
	n.final_schedule.slot_no++;

	//fill rest slot
	n.final_schedule.slot[n.final_schedule.slot_no].FillSlot(REST,Plus(n.current_time,TravelTime(n.current_location,p.location)),p.schedule.FindSlot(FREE).start_time,p.location,p.location);
	n.final_schedule.slot_no++;

	//fill serve slot
	n.final_schedule.slot[n.final_schedule.slot_no].FillSlot(SERVE,p.schedule.FindSlot(FREE).start_time,p.schedule.FindSlot(FREE).end_time,p.location,p.location);
	n.final_schedule.slot_no++;
			
	return;
}

void Initiation(char * filename)                  //read information nessarary for the algorithm
{
	//read information file
	info.open(filename);
	
	int i=0;
	int j=0;
	char line[100];
	char temp[10];

	//read patient number
	info.getline(line,100);
	while(line[i]==' ')i++;
	while(line[i]!='\0')temp[j++]=line[i++];
	temp[j]='\0';
	patient_no=strtol(temp,&STOP,10);

	patient=new PATIENT[patient_no];
	
	//read each patient
	for(int k=0;k<patient_no;k++)
	{
		//read location
		info.getline(line,100);
		i=0;
		j=0;
		while(line[i]==' ')i++;
		while(line[i]!=',')temp[j++]=line[i++];
		temp[j]='\0';
		patient[k].location.x=strtol(temp,&STOP,10);
		j=0;
		i++;
		while(line[i]==' ')i++;
		while(line[i]!='\0')temp[j++]=line[i++];
		temp[j]='\0';
		patient[k].location.y=strtol(temp,&STOP,10);

		//read slot numbers
		info.getline(line,100);
		i=0;
		j=0;
		while(line[i]==' ')i++;
		while(line[i]!='\0')temp[j++]=line[i++];
		temp[j]='\0';
		patient[k].schedule.slot_no=strtol(temp,&STOP,10);

		patient[k].schedule.slot=new SLOT[patient[k].schedule.slot_no];

		//read each slot
		for(int l=0;l<patient[k].schedule.slot_no;l++)
		{
			//read slot name
			info.getline(line,100);
			i=0;
			j=0;
			while(line[i]==' ')i++;
			while(line[i]!=',')temp[j++]=line[i++];
			temp[j]='\0';
			if(!strcmp(temp,"busy"))patient[k].schedule.slot[l].name=BUSY;
			if(!strcmp(temp,"free"))patient[k].schedule.slot[l].name=FREE;

			//read start time
			i++;
			j=0;
			while(line[i]==' ')i++;
			while(line[i]!=',')temp[j++]=line[i++];
			temp[j]='\0';
			patient[k].schedule.slot[l].start_time=strtol(temp,&STOP,10);

			//read end time
			i++;
			j=0;
			while(line[i]==' ')i++;
			while(line[i]!='\0')temp[j++]=line[i++];
			temp[j]='\0';
			patient[k].schedule.slot[l].end_time=strtol(temp,&STOP,10);

			patient[k].schedule.slot[l].start_location.x=patient[k].schedule.slot[l].end_location.x=patient[k].location.x;
			patient[k].schedule.slot[l].start_location.y=patient[k].schedule.slot[l].end_location.y=patient[k].location.y;
		}

		patient[k].served=0;
	}
			
	//read nurse number
	info.getline(line,100);
	i=0;
	j=0;
	while(line[i]==' ')i++;
	while(line[i]!='\0')temp[j++]=line[i++];
	temp[j]='\0';
	nurse_no=strtol(temp,&STOP,10);

	nurse=new NURSE[nurse_no];
	
	//read each nurse
	for(k=0;k<nurse_no;k++)
	{
		//read location
		info.getline(line,100);
		i=0;
		j=0;
		while(line[i]==' ')i++;
		while(line[i]!=',')temp[j++]=line[i++];
		temp[j]='\0';
		nurse[k].home.x=strtol(temp,&STOP,10);
		j=0;
		i++;
		while(line[i]==' ')i++;
		while(line[i]!='\0')temp[j++]=line[i++];
		temp[j]='\0';
		nurse[k].home.y=strtol(temp,&STOP,10);

		nurse[k].serve_no=0;
		nurse[k].current_time=DAY_START_TIME;
		nurse[k].current_location.x=nurse[k].home.x;
		nurse[k].current_location.y=nurse[k].home.y;

		//read slot numbers
		info.getline(line,100);
		i=0;
		j=0;
		while(line[i]==' ')i++;
		while(line[i]!='\0')temp[j++]=line[i++];
		temp[j]='\0';
		nurse[k].init_schedule.slot_no=strtol(temp,&STOP,10);
		
		nurse[k].init_schedule.slot=new SLOT[nurse[k].init_schedule.slot_no];

		//read each slot
		for(int l=0;l<nurse[k].init_schedule.slot_no;l++)
		{
			//read slot name
			info.getline(line,100);
			i=0;
			j=0;
			while(line[i]==' ')i++;
			while(line[i]!=',')temp[j++]=line[i++];
			temp[j]='\0';
			if(!strcmp(temp,"work"))nurse[k].init_schedule.slot[l].name=WORK;
			if(!strcmp(temp,"rest"))nurse[k].init_schedule.slot[l].name=REST;

			//read start time
			i++;
			j=0;
			while(line[i]==' ')i++;
			while(line[i]!=',')temp[j++]=line[i++];
			temp[j]='\0';
			nurse[k].init_schedule.slot[l].start_time=strtol(temp,&STOP,10);

			//read end time
			i++;
			j=0;
			while(line[i]==' ')i++;
			while(line[i]!='\0')temp[j++]=line[i++];
			temp[j]='\0';
			nurse[k].init_schedule.slot[l].end_time=strtol(temp,&STOP,10);

			nurse[k].init_schedule.slot[l].start_location.x=nurse[k].init_schedule.slot[l].end_location.x=nurse[k].home.x;
			nurse[k].init_schedule.slot[l].start_location.y=nurse[k].init_schedule.slot[l].end_location.y=nurse[k].home.y;
		}
	}

	//read max number of patients a nurse can serve within a day
	info.getline(line,100);
	i=0;
	j=0;
	while(line[i]==' ')i++;
	while(line[i]!='\0')temp[j++]=line[i++];
	temp[j]='\0';
	max_no=strtol(temp,&STOP,10);

	//initiate final schedule
	for(k=0;k<nurse_no;k++)
	{
		nurse[k].final_schedule.slot_no=0;
		nurse[k].final_schedule.slot=new SLOT[4*max_no];
	}

	//end reading file
	info.close();
}

void Schedule(void)
{
	//assign nurse
	for(int i=0;i<nurse_no;i++)
	{
		while(nurse[i].serve_no<max_no)       //1 round
		{
			if(served_no==patient_no)return;
			
			int minH=2000;
			int select=-1;
		
			//select patient
			for(int j=0;j<patient_no;j++)
			{
				if(CanServe(nurse[i],patient[j]))
				{
					if(H(nurse[i],patient[j])<minH)
					{
						minH=H(nurse[i],patient[j]);
						select=j;
					}
				}
			}

			if(select>=0)
			{
				//select one patient
				patient[select].served=1;
				nurse[i].serve_no++;
				UpdateSchedule(nurse[i],patient[select]);
				nurse[i].current_time=minH;
				nurse[i].current_location.x=patient[select].location.x;
				nurse[i].current_location.y=patient[select].location.y;
			}
			else
			{
				//change another nurse
				break;
			}
		}

		nurse[i].final_schedule.slot[nurse[i].final_schedule.slot_no].FillSlot(REST,nurse[i].current_time,DAY_END_TIME,nurse[i].current_location,nurse[i].home);
		nurse[i].final_schedule.slot_no++;
	}
}

void Output(void)
{
	for(int i=0;i<nurse_no;i++)
	{
		out<<" ---------------\n";
		out<<"|nurse"<<'\t'<<i<<'\t'<<'|'<<'\n';
		out<<" ---------------\n";
		nurse[i].final_schedule.print();
		out<<'\n';
		out<<'\n';
	}
}

int main(int argc, char * argv[])
{
	if(argc<3)
	{
		cout<<"Please input the infomation file name and output file name!"<<'\n';
		return 1;
	}
	
	//read information
	Initiation(argv[1]);
	
	//open output file
	out.open(argv[2]);

	//algorithm
    Schedule();

	//output
	Output();

	//release
	for(int i=0;i<nurse_no;i++)
	{
		delete []nurse[i].init_schedule.slot;
		delete []nurse[i].final_schedule.slot;
	}

	delete []nurse;

	for(i=0;i<patient_no;i++)
	{
		delete []patient[i].schedule.slot;
	}

	delete []patient;

	out.close();

	return 0;
}