1026 Table Tennis(难)

题目

题意: k张桌子,球员到达后总是选择编号最小的桌子。如果训练时间超过2h会被压缩成2h,如果到达时候没有球桌空闲就变成队列等待。k张桌子中m张是vip桌,如果vip桌子有空闲,而且队列里面有vip成员,那么等待队列中的第一个vip球员会到最小的vip球桌训练。如果vip桌子空闲但是没有vip来,那么就分配给普通的人。如果没有vip球桌空闲,那么vip球员就当作普通人处理。给出每个球员的到达时间、要玩多久、是不是vip(是为1不是为0)。给出球桌数和所有vip球桌的编号,QQ所有在关门前得到训练的球员的到达时间、训练开始时间、等待时长(取整数,四舍五入),营业时间为8点到21点。如果再21点后还没有开始玩的人,就不再玩,不需要输出

tip:模拟

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
struct person {
	int arrive, start, time;
	bool vip;
} tempperson;
struct tablenode {
	int end = 8 * 3600, num;
	bool vip;
};
bool cmp1(person a, person b) {
	return a.arrive < b.arrive;
}
bool cmp2(person a, person b) {
	return a.start < b.start;
}
vector<person> player;
vector<tablenode> table;
void alloctable(int personid, int tableid) {
	if(player[personid].arrive <= table[tableid].end)//玩家到达时间早于桌子空闲时间 
		player[personid].start = table[tableid].end;
	else
		player[personid].start = player[personid].arrive;
	table[tableid].end = player[personid].start + player[personid].time;
	table[tableid].num++;
}
int findnextvip(int vipid) {
	vipid++;
	while(vipid < player.size() && player[vipid].vip == false) {
		vipid++;
	}
	return vipid;
}
int main() {
	int n, k, m, viptable;
	scanf("%d", &n);
	for(int i = 0; i < n; i++) {
		int h, m, s, temptime, flag;
		scanf("%d:%d:%d %d %d", &h, &m, &s, &temptime, &flag);
		tempperson.arrive = h * 3600 + m * 60 + s;
		tempperson.start = 21 * 3600;
		if(tempperson.arrive >= 21 * 3600)
			continue;
		tempperson.time = temptime <= 120 ? temptime * 60 : 7200;
		tempperson.vip = ((flag == 1) ? true : false);
		player.push_back(tempperson);
	}
	scanf("%d%d", &k, &m);
	table.resize(k + 1);
	for(int i = 0; i < m; i++) {
		scanf("%d", &viptable);
		table[viptable].vip = true;
	}
	sort(player.begin(), player.end(), cmp1);
	int i = 0, vipid = -1;
	vipid = findnextvip(vipid);
	while(i < player.size()) {
		int index = -1, minendtime = 999999999;
		for(int j = 1; j <= k; j++) {//找最先空出来的桌子 
			if(table[j].end < minendtime) {
				minendtime = table[j].end;
				index = j;
			}
		}
		if(table[index].end >= 21 * 3600)
			break;//健身馆关门 
		if(player[i].vip == true && i < vipid) {
			i++;//前面VIP人员已经出现过了 
			continue;
		}
		if(table[index].vip == true) {//最先空出来的桌子是VIP桌子 
			if(player[i].vip == true) {
				alloctable(i, index);//VIP人员分配VIP桌子 
				if(vipid == i)
					vipid = findnextvip(vipid);
				i++;
			} else {//非VIP人员,将VIP桌子分配给队列中VIP人员 
				if(vipid < player.size() && player[vipid].arrive <= table[index].end) {
					alloctable(vipid, index);
					vipid = findnextvip(vipid);
				} else {//队列中无VIP人员,则分配给普通人员 
					alloctable(i, index);
					i++;
				}
			}
		} else {
			if(player[i].vip == false) {//非VIP人员直接分配普通桌子 
				alloctable(i, index);
				i++;
			} else {//VIP人员分配最早空闲的VIP桌子 
				int vipindex = -1, minvipendtime = 999999999;
				for(int j = 1; j <= k; j++) {
					if(table[j].vip == true && table[j].end < minvipendtime) {
						minvipendtime = table[j].end;
						vipindex = j;
					}
				}//若存在最早的VIP空闲桌子 
				if(vipindex != -1 && player[i].arrive >= table[vipindex].end) {
					alloctable(i, vipindex);
					if(vipid == i)
						vipid = findnextvip(vipid);
					i++;
				} else {//不存在最早空闲的VIP桌子,找到分配最先空闲的普通桌子 
					alloctable(i, index);
					if(vipid == i)
						vipid = findnextvip(vipid);
					i++;
				}
			}
		}
	}
	sort(player.begin(), player.end(), cmp2);
	for(i = 0; i < player.size() && player[i].start < 21 * 3600; i++) {
		printf("%02d:%02d:%02d ", player[i].arrive / 3600, player[i].arrive % 3600 / 60, player[i].arrive % 60);
		printf("%02d:%02d:%02d ", player[i].start / 3600, player[i].start % 3600 / 60, player[i].start % 60);
		printf("%.0f\n", round((player[i].start - player[i].arrive) / 60.0));
	}
	for(int i = 1; i <= k; i++) {
		if(i != 1)
			printf(" ");
		printf("%d", table[i].num);
	}
	return 0;
}
发布了382 篇原创文章 · 获赞 17 · 访问量 1万+

猜你喜欢

转载自blog.csdn.net/qq_40991687/article/details/104215114