1017. Queueing at Bank

题目链接:http://pat.zju.edu.cn/contests/pat-a-practise/1017

模拟排队

// WA: + 打成 += 
// 不好找呢,还是心不静呢?

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

struct People
{
	int hour, minutes, second;
	int total;
	int need;
	int wait;
};


vector<People> v;
int N, K;


void Input();
bool compare(People a, People b);
void Output();


bool compare(People a, People b)
{
	return a.total<b.total;
}

void Input()
{
	cin >> N >> K;
	People p;
	while(N-->0)
	{
		cin >> p.hour;
		getchar();
		cin >> p.minutes;
		getchar();
		cin >> p.second;
		cin >> p.need;
		p.total = p.hour*60*60 + p.minutes*60 + p.second;
		v.push_back(p);
	}
	return ;
}


void Output()
{
	vector<People>::iterator it;
	int begintime[100];//每个窗口下次可用的时间,单位为s
	for(int i=0; i<K; i++)
	{
		begintime[i]=8*60*60;
	}

	int sum=0, num=0;
	for(it=v.begin(); it != v.end(); it++)
	{
		if((*it).hour < 17 || ( (*it).hour==17 && (*it).minutes ==0 && (*it).second == 0 ))
		{
			num++;
		}
		else
		{
			break;
		}
		sort(begintime, begintime+K);
		int *p = begintime;//选取最小的时间
		if(*p > (*it).total)
		{
			(*it).wait = *p-(*it).total;
			sum += (*it).wait;
			*p += (*it).need*60;
		}
		else
		{
			(*it).wait = 0;
			sum += (*it).wait;
			*p = (*it).total+(*it).need*60;
		}
	}
	printf("%.1lf\n", (sum/60.0)/num);
}

void show()
{
	int i;
	for(i=0; i<v.size(); i++)
	{
		printf("%7d %02d:%02d:%02d %d\n", v[i].total, v[i].hour, v[i].minutes, v[i].second, v[i].need*60);
	}
	return ;
}


int main()
{
	#ifdef ONLINE_JUDGE
	#else
		freopen("E:\\in.txt", "r", stdin);
	//	freopen("E:\\out.txt", "w", stdout);
	#endif
	Input();
	sort(v.begin(), v.end(), compare);
	Output();
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Queueing theory is a mathematical study of waiting lines or queues that arise in various real-life scenarios, such as customer service, traffic congestion, hospital emergency rooms, and telecommunications networks. Basic queueing theory involves the following concepts: 1. Arrival Process: This is the process of customers arriving at the queue. The arrival process can be modeled using different distributions, such as Poisson or exponential. 2. Service Process: This is the process of serving customers in the queue. The service process can also be modeled using different distributions, such as Poisson or exponential. 3. Queue Length: This is the number of customers waiting in the queue at any given time. 4. Queue Occupancy: This is the proportion of time that the server is busy serving customers. 5. System Capacity: This is the maximum number of customers that the system can handle at any given time. 6. Utilization: This is the proportion of time that the server is busy serving customers compared to the total time. 7. Waiting Time: This is the time that a customer spends waiting in the queue before being served. 8. Service Time: This is the time that a customer spends being served by the server. 9. Queueing Models: There are different queueing models that can be used to analyze queueing systems, such as the M/M/1 model, M/M/c model, M/G/1 model, and M/D/1 model. 10. Performance Measures: Different performance measures can be used to evaluate queueing systems, such as average waiting time, average queue length, and system throughput.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值