1026. Table Tennis 解析

最新推荐文章于 2020-07-24 16:20:18 发布
原创 最新推荐文章于 2020-07-24 16:20:18 发布 · 1k 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
文章标签：

#PAT

你们尽管看我的程序，看得懂的算我输！！！ （我自己都看不懂了......）

这个排队好麻烦。

我是按桌子来分类的。

1、VIP桌可用 ：有人等待,有VIP先给VIP，没有给队列最前面的人。

没有人等待,给队列最前面的人。

2、普通桌可用：按顺序来。

3、VIP桌和普通桌都可以用：有人等待，有VIP先给VIP分配VIP桌，没有VIP给队列最前的人。优先号小的桌子

    没人等待，给队列最前面的人。优先号小的桌子。

（但愿逻辑没错吧，我也乱了_(:з)∠)_）

……………………更新线……………………

果不其然 我自己看不懂了2333333

http://blog.youkuaiyun.com/sunbaigui/article/details/8656863

http://www.cnblogs.com/aiwz/p/6154036.html

贴两个链接吧，第一个是原作者，第二个是解释。

主体思想还是队伍里面有VIP就先给VIP分配，没有就给最前面的分配。大神写的代码的思想挺有意思的~~


#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <climits>
#include <queue>

#define MAX 10010
#define MAX2 110
#define EndTime 75600

using namespace std;

int N;
int Table, VipTable;
int ServeCount;//服务人数计数

vector <int> Vipnum;

struct Node{
	string arrive;
	int arriveTime;
	int time;
	int tag;
	int serveTime;
	int waitTime;
	bool isServe;
	int TabNum;
};

Node c[MAX];


struct Tab {
	int Num;
	int time;
	int count;
};

vector <Tab> t; // 普通
vector <Tab> tv;// VIP



int c2int(char c){
	return int(c - '0');
}


int str2int(string s){
	int sum = 0;
	sum	+= 3600 * (c2int(s[0]) * 10 + c2int(s[1]));
	sum += 60 * (c2int(s[3]) * 10 + c2int(s[4]));
	sum += c2int(s[6]) * 10 + c2int(s[7]);
	return sum;
}

bool cmp(Node n1, Node n2) {
	return str2int(n1.arrive) < str2int(n2.arrive);
}

bool cmp2(Tab t1, Tab t2) {
	return t1.Num < t2.Num;
}

bool cmp3(Node n1, Node n2) {
	return n1.serveTime < n2.serveTime;
}

int MinVipTab() {
	int ti = -1, min = INT_MAX;
	for (int i = 0; i < tv.size(); i++) {
		if (min > tv[i].time) {
			min = tv[i].time;
			ti = i;
		}
	}
	return ti;
}

int MinTab() {
	int ti = -1, min = INT_MAX;
	for (int i = 0; i < t.size(); i++) {
		if (min > t[i].time) {
			min = t[i].time;
			ti = i;
		}
	}
	return ti;
}


void Serve(Node * c) {
	int pv = MinVipTab();
	int p = MinTab();

	int HaveVip = false;
	int isFind = false;
	
	int ServeI = 0;
	bool st = true, isFindVip = false, isWait = false;

	vector <int> NoWait;//不需要等待
	vector <int> Wait;//需要等待


	if (tv[pv].time < t[p].time) { //VIP桌可用
		for (int i = 0; i < N; i++) {
			if (!c[i].isServe) {
				if (c[i].arriveTime < tv[pv].time) { //要等待
					Wait.push_back(i); 
					isWait = true;
				}
				else {
					if (isWait) break; // 有需要等待的 必然没有不等待的
					else { //不需要等待 则直接用 没有人同时到
						NoWait.push_back(i); break;
					}
					
				}
			}
		}

		if (Wait.size() != 0) {//有需要等待的 
			int ti = Wait[0];
			for (int i = 0; i < Wait.size(); i++) {//查找是否有VIP
				if (c[Wait[i]].tag == 1) {
//					isFindVip = true;
					ti = Wait[i];
					break;
				}
			}
			
			c[ti].waitTime = tv[pv].time - c[ti].arriveTime;
			c[ti].serveTime = tv[pv].time;
			if (c[ti].serveTime < EndTime) {
				c[ti].isServe = true;
				tv[pv].count++;
				c[ti].TabNum = tv[pv].Num;
			}
			ServeCount--;
			tv[pv].time += c[ti].time;
		}

		else {//不需要等待
			int ti = NoWait[0];
			c[ti].waitTime = 0;
			c[ti].serveTime = c[ti].arriveTime;
			tv[pv].time = c[ti].arriveTime;
			if (c[ti].serveTime < EndTime) {
				c[ti].isServe = true;
				tv[pv].count++;
				c[ti].TabNum = tv[pv].Num;
			}
			ServeCount--;
			tv[pv].time += c[ti].time;
		}
	}
	
	else if(tv[pv].time > t[p].time){ //普通桌可用
		int ti = 0;
		for (int i = 0; i < N; i++) {
			if (!c[i].isServe) {
				ti = i;
				break;
			}
		}

		if (c[ti].arriveTime < t[p].time) { //需要等待
			c[ti].waitTime = t[p].time - c[ti].arriveTime;
			c[ti].serveTime = t[p].time;
			if (c[ti].serveTime < EndTime) {
				c[ti].isServe = true;
				t[p].count++;
				c[ti].TabNum = t[p].Num;
			}
			ServeCount--;
			t[p].time += c[ti].time;
		}
		else {
			c[ti].waitTime = 0;
			c[ti].serveTime = c[ti].arriveTime;
			t[p].time = c[ti].arriveTime;
			if (c[ti].serveTime < EndTime) {
				c[ti].isServe = true;
				t[p].count++;
				c[ti].TabNum = t[p].Num;
			}
			ServeCount--;
			t[p].time += c[ti].time;
		}

	}

	else { //普通桌和VIP桌相同
		for (int i = 0; i < N; i++) {
			if (!c[i].isServe) {
				if (c[i].arriveTime < tv[pv].time) { //要等待
					Wait.push_back(i);
					isWait = true;
				}
				else {
					if (isWait) break; // 有需要等待的 必然没有不等待的
					else { //不需要等待 则直接用 没有人同时到
						NoWait.push_back(i); break;
					}
				}
			}
		}
		
		if (Wait.size() != 0) {//有需要等待的 
			int ti = Wait[0];
			for (int i = 0; i < Wait.size(); i++) {//查找是否有VIP
				if (c[Wait[i]].tag == 1) {
					isFindVip = true;
					ti = Wait[i];
					break;
				}
			}

			if (isFindVip) {//有vip
				c[ti].waitTime = tv[pv].time - c[ti].arriveTime;
				c[ti].serveTime = tv[pv].time;
				if (c[ti].serveTime < EndTime) {
					c[ti].isServe = true;
					tv[pv].count++;
					c[ti].TabNum = tv[pv].Num;
				}
				ServeCount--;
				tv[pv].time += c[ti].time;
			}

			else {
				c[ti].waitTime = t[p].time - c[ti].arriveTime;
				c[ti].serveTime = t[p].time;
				if (c[ti].serveTime < EndTime) {
					c[ti].isServe = true;
					t[p].count++;
					c[ti].TabNum = t[p].Num;
				}
				ServeCount--;
				t[p].time += c[ti].time;
			}

		}
		else {//VIP桌和普通桌都能用 选号小的
			int ti = NoWait[0];
			if (c[ti].tag == 1) {//VIP				
				c[ti].waitTime = 0;
				c[ti].serveTime = c[ti].arriveTime;
				tv[pv].time = c[ti].arriveTime;
				if (c[ti].serveTime < EndTime) {
					c[ti].isServe = true;
					tv[pv].count++;
					c[ti].TabNum = tv[pv].Num;
				}
				ServeCount--;
				tv[pv].time += c[ti].time;
			}
			else {
				if (tv[pv].Num > t[p].Num) {

					c[ti].waitTime = 0;
					c[ti].serveTime = c[ti].arriveTime;
					t[p].time = c[ti].arriveTime;
					if (c[ti].serveTime < EndTime) {
						c[ti].isServe = true;
						t[p].count++;
						c[ti].TabNum = t[p].Num;
					}
					ServeCount--;
					t[p].time += c[ti].time;
				}
				else {
					c[ti].waitTime = 0;
					c[ti].serveTime = c[ti].arriveTime;
					tv[pv].time = c[ti].arriveTime;
					if (c[ti].serveTime < EndTime) {
						c[ti].isServe = true;
						tv[pv].count++;
						c[ti].TabNum = tv[pv].Num;
					}
					ServeCount--;
					tv[pv].time += c[ti].time;
				}
			}
		}

	}

}






void printTime(int num) {
	int HH;
	int MM;
	int SS;

	HH = num / 3600;
	MM = num % 3600 / 60;
	SS = num % 3600 % 60;
	
	printf("%02d", HH);
	cout << ":";
	printf("%02d", MM);
	cout << ":";
	printf("%02d", SS);
}

void printMM(int MM){
	int isC = MM % 60;
	MM /= 60;
	if (isC >= 30) MM++;
	cout << MM;
}


int main() {
	cin >> N;
	ServeCount = N;
	
	for (int i = 0; i < N; i++) {
		cin >> c[i].arrive >> c[i].time >> c[i].tag;
		if (c[i].time > 120) {
			c[i].time = 120;
		}
		c[i].time *= 60;
		c[i].arriveTime = str2int(c[i].arrive);
		c[i].isServe = false;

/*		if (c[i].arriveTime <= 8 * 3600)
			while (1);			*/	
	}

	cin >> Table >> VipTable;

	
	

	Tab  tempt;
	tempt.time = 8*3600;
	tempt.count = 0;

	for (int i = 0; i < VipTable; i++) {
		cin >> tempt.Num;
		tempt.Num--;	
		tv.push_back(tempt);
	}

	sort(&tv[0], &tv[0] + VipTable, cmp2);

	for (int i = 0,j =0; i < Table; i++) {
		if (i != tv[j].Num) {
			tempt.Num = i;
			t.push_back(tempt);
		}
	}


#ifdef _DEBUG
	for (int i = 0; i < t.size(); i++) {
		cout << t[i].Num << " " << t[i].time << " " << t[i].count << endl;
	}
	for (int i = 0; i < tv.size(); i++) {
		cout << tv[i].Num << " " << tv[i].time << " " << tv[i].count << endl;
	}
#endif

	sort(&c[0], &c[0] + N, cmp);

#ifdef _DEBUG
	for (int i = 0; i < N; i++) {
		cout << c[i].arrive << " " << c[i].time /60 << " "
			<< str2int(c[i].arrive) << " ";
		if (c[i].tag == 1)
			cout << " VIP ";
		else
			cout << " NoV ";
		cout << endl;
	}
#endif

	//for (int i = 0; i < N; i++) {
	//	Serve(c[i]);
	//}

	while (ServeCount) {
		Serve(c);
	}

	sort(&c[0], &c[0] + N, cmp3);


	for (int i = 0; i < N; i++) {
		if (c[i].isServe) {
			cout << c[i].arrive << " ";
			printTime(c[i].serveTime);
			cout << " ";
			printMM(c[i].waitTime);	
#ifdef _DEBUG
			cout << " " << c[i].TabNum + 1;
			if (c[i].tag == 1)
				cout << " VIP ";
			else
				cout << " NoV ";
#endif
			cout << endl;
		}
	}

	vector <Tab> golbeT;
	for (int i = 0; i < tv.size(); i++) {
		golbeT.push_back(tv[i]);
	}
	for (int i = 0; i < t.size(); i++) {
		golbeT.push_back(t[i]);
	}
	sort(&golbeT[0], &golbeT[0] + Table, cmp2);

	for (int i = 0; i < Table -1 ; i++) {
		cout << golbeT[i].count << " ";
	}
	cout << golbeT[Table - 1].count << endl;


	system("pause");

	return 0;
}


1026 Table Tennis
daybreak_alonely的博客
11-06 409
【代码】1026 Table Tennis。
1026 Table Tennis (30分)--PAT甲级真题（测试点过不了来看看排坑）
Samson的博客
04-19 1018
A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they will be assigned to the ava...
PAT甲组1026.Table Tennis思路与注意点--补充《算法笔记》
九筒的博客
03-22 500
A1026 题目链接 个人思路 老早就看到此题4页代码，心里就有点慌了。花费数小时完成此题，这种复杂模拟题确实太费神了。个人一开始一直陷入vip的处理问题，不知道如何下手，后来参考了答案思路后，按照四个判定条件，方才厘清一些头绪（还是缺乏将具体问题转换为代码思维的能力）。 个人是先将第一批球员安排到每个台子上，随后再对后面排队的球员进行分配 编程过程中未注意到的问题： 时间压缩到2h 到达时已经...
1026 Table Tennis
yu121380的博客
03-15 244
1026Table Tennis（30分) A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they w...
精选资源
fpga.rar_advance fpga_perl game_table tennis fpga
09-24
标题中的“fpga.rar_advance fpga_perl game_table tennis fpga”揭示了这是一个关于使用FPGA（Field-Programmable Gate Array，现场可编程门阵列）开发的乒乓球游戏项目，其中可能涉及到高级FPGA技术，并且可能使用...
Windows游戏编程入门——TableTennis小游戏
05-06
"TableTennis"小游戏就是这样一个例子，它为想要涉足游戏开发的新手提供了一个良好的起点。这个项目的核心目标是实现一个弹球游戏，它的设计简洁，逻辑清晰，而且注释详尽，使得学习过程更为直观。 首先，让我们...
统计下文中单词出现的个数存入字典，统计出现字数最多的三个单词和最少三个单词。删除原文中出现次数第二多的单词，其他单词保持顺序不变，先试试删除单词后的文章。 Sports help everyone to keep healthy, happy, and efficient. So 1 pay special attention to games,especially table-tennis. Table tennis is my favorite game. I play it almost every day Table-tennis is an ideal game for us because it brings the whole body into action. It strengthens our muscles, expands our lungs, promotes the circulation of the blood, and causes a healthy action of the skin. Besides, it is very amusing and does not cost us much money. Table-tennis is very moderate; it is not so rough as football. It is an indoor game and can be played even on rainy days. Thus, it is my favorite kind of exercise. One morning a fox sees a cock.He think,"This is my breakfast. He comes up to the cock and says,"I know you can sing very well.Can you sing for me? The cock is glad.He closes his eyes and begins to sing.The fox sees that and catches him in his mouth and carries him away. The people in the field see the fox.They cry,"Look, look!The fox is carrying the cock away. The cock says to the fox,"Mr Fox,do you understand?The people say you are carrying their cock away.Tell them it is yours.Not theirs. The fox opens his mouth and says,"The cock is mine, not yours.Just then the cock runs away from the fox and flies into the tree.多加注释，要流程图
最新发布
06-03
### 代码注释解析 1. **文本预处理**：使用正则表达式`\b[a-zA-Z]+\b`过滤非字母字符，保留完整单词结构[^2] 2. **频率统计**：采用`defaultdict`实现高效计数，时间复杂度O(n) 3. **排序处理**： - 主排序按频率...
python输出My favorite sports are as follows: football table tennis badminton swimming running
03-15
嗯，用户想用Python打印...### 关键点解析 1. `join()`方法可以将列表元素用指定字符连接 2. `f-string`格式化支持直接插入变量值 3. `enumerate()`函数可以同时获取元素索引和值 4. 转义字符`\n`用于创建换行显示[^2]
PAT 甲级 1026 Table Tennis（模拟）
weixin_30612769的博客
05-31 233
1026. Table Tennis (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A table tennis club has N tables available to the public. The tables are number...
1026 Table Tennis (30分)
momoomoo的博客
07-24 238
据说是PAT最难的一道模拟题，情况很复杂，第二次做了，依旧是折磨人的小妖精(*￣︶￣)。 这次主要是栽在条件判断上了，一定要小心数组越界！而且这种错很难找 （代码里※标注的地方，就是我找错找了好久的地方） #include <iostream> #include <stdio.h> #include <stdlib.h> #include <math.h> #include <string.h> #include <map> #incl
1026. Table Tennis (30)
weixin_30312659的博客
08-29 128
题目如下： A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive, they will be as...
PAT 1026. Table Tennis
Stephen Wong的专栏
04-12 1252
第一篇blog : p 测试点4考察的是  For any pair of players, if there are some tables open when they arrive, they will be assigned to the available table with the smallest number.
pat1026 Table Tennis
coding my life
02-26 722
1.当有多个乒乓球台空闲时，vip顾客到了会使用最小id的vip球台，而不是最小id的球台，测试以下用例：2 10:00:00 30 1 12:00:00 30 1 5 1 3 输出正确结果应为： 10:00:00 10:00:00 0 12:00:00 12:00:00 0 0 0 2 0 0   2.题目要求每对顾客玩的时间不超过2小时，那么当顾客要求玩的时间>2小时的时候，应该截
PAT 甲级 1026  Table Tennis
漫浸天空的雨色的备忘录~
01-21 847
1026 Table Tennis （30 point(s)） A table tennis club has N tables available to the public. The tables are numbered from 1 to N. For any pair of players, if there are some tables open when they arrive,...
1026. Table Tennis
null
06-27 371
#include #include #include #include using namespace std; const int INF=1<<30,K=103; struct node{ int come,cost,vip,serve,done; node(int a,int b,int c,int d,bool e):come(a*3600+b*60+c), cost(
评论 1
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
表情包 代码片
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值