习题5-13(uva-822)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>

#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
struct Request
{
	int cnt;		//总请求数量
	int reqArrCnt;	//请求到达的数量
	int dealCnt;	//正在处理的请求数量
	int overCnt;	//处理完毕的请求数量
	int start;		//上一个请求到达时间
	int take;		//请求处理时间
	int interval;	//请求到达间隔时间
	int lastDealTime;  //本次处理完成时间
};

struct Customer {
	int pid;
	int k;
	int lastDeal;	//上一次请求处理请求时间
	int lastOver;	//上一次请求处理结束时间
	int lastid;		//上一次请求处理的tid
	vector<int> pri;//优先级
	int reqList[20];//按优先级 本轮能够处理请求的tid列表
	int reqFirst;	//第一个合法的下标 前面可能已经被其他客服抢了
	int reqCnt;		//本轮tid列表数量
};
//请求列标
unordered_map<int, Request> req;

Customer c[10];
Request r;

void GetRequest() {
	int id,index = 0;
	cin >> id >> r.cnt >> r.start >> r.take >> r.interval;
	r.lastDealTime = r.reqArrCnt = r.dealCnt = r.overCnt = 0;
	req[id] = r;
}

void GetCustom(int index) {
	cin >> c[index].pid >> c[index].k;
	int len = c[index].k,t = 0;
	c[index].pri.clear();
	for (int i = 0; i < len; ++i) {
		cin >> t;
		c[index].pri.emplace_back(t);
	}
	c[index].lastDeal = c[index].lastOver = c[index].lastid = 0;
}

void GetDealList(int index,int cur) {
	vector<int>& a = c[index].pri;
	int id;
	for (int i = 0; i < a.size(); ++i) {
		id = a[i];
		if(req.count(id) == 0 || req[id].dealCnt + req[id].overCnt >= req[id].reqArrCnt ) continue;
		c[index].reqList[c[index].reqCnt++] = id;
	}
}
//新的请求到达
void ReqArrive(int cur) {
	for (auto it = req.begin(); it != req.end(); ++it) {
		if(it->second.reqArrCnt >= it->second.cnt) continue;
		if (it->second.start <= cur){
			it->second.reqArrCnt++;
			it->second.start = cur + it->second.interval;
		}
	}
}
//当前客服是否 处理当前请求优先级最高
bool IsFirst(int cnt,int cid, int tid) {
	
	//前面的都已经处理完毕
	for (int i = cid + 1; i < cnt; ++i) {
		//比较有处理请求列表的
		if( c[i].lastid || (c[i].reqCnt - c[i].reqFirst) == 0) continue;
		//最高优先级有相同的请求
		if (c[i].reqList[c[i].reqFirst] == tid) {
			if (c[i].lastDeal < c[cid].lastDeal) { c[cid].reqFirst++; return false; }
			else if (c[i].lastDeal > c[cid].lastDeal) { c[i].reqFirst++; }
			else {
				if(c[i].pid < c[cid].pid) { c[cid].reqFirst++; return false; }
				else { c[i].reqFirst++; return true; }
			}
		}
	}
	return true;
}
void DoDeal(int cnt,int cur) {
	for (int i = 0; i < cnt; ++i) {
		if(c[i].lastid || (c[i].reqCnt - c[i].reqFirst) == 0) continue;
		for (int j = c[i].reqFirst; j < c[i].reqCnt; ++j) {
			if (IsFirst(cnt, i, c[i].reqList[j])) {
				//处理当前请求
				int tid = c[i].reqList[j];
				c[i].lastDeal = cur;
				c[i].lastOver = cur + req[tid].take;
				c[i].lastid = tid;
				req[tid].lastDealTime = c[i].lastOver;
				req[tid].dealCnt++;
				break;
			}
		}
	}
}
int main()
{
	int n, count = 0;
	while (cin >> n && n) {
		int cur = 0, m, tid;
		req.clear();

		for (int i = 0; i < n; ++i)
			GetRequest();

		cin >> m;
		for (int i = 0; i < m; ++i)
			GetCustom(i);

		while (!req.empty()) {

			ReqArrive(cur);

			for (int i = 0; i < m; ++i) {
				tid = c[i].lastid;
				if (tid) {
					if (c[i].lastOver > cur) continue;
					if (++req[tid].overCnt == req[tid].cnt) req.erase(tid);
					else req[tid].dealCnt--;
					c[i].lastid = 0;
				}
			}

			if(req.empty()) break;

			for (int i = 0; i < m; ++i) {
				c[i].reqCnt = c[i].reqFirst = 0;
				tid = c[i].lastid;
				if (tid) continue;
				GetDealList(i, cur);
			}
			DoDeal(m, cur);
			++cur;
		}
		cout << "Scenario " << ++count << ": All requests are serviced within " << cur << " minutes." << endl;
	}
	
	return 0;
}

利用排序

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>

#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
struct Request
{
	int cnt;		//总请求数量
	int reqArrCnt;	//请求到达的数量
	int dealCnt;	//正在处理的请求数量
	int overCnt;	//处理完毕的请求数量
	int start;		//上一个请求到达时间
	int take;		//请求处理时间
	int interval;	//请求到达间隔时间
	int lastDealTime;  //本次处理完成时间
};

struct Customer {
	int pid;
	int k;
	int lastDeal;	//上一次请求处理请求时间
	int lastOver;	//上一次请求处理结束时间
	int lastid;		//上一次请求处理的tid
	vector<int> pri;//优先级
	bool operator<(const Customer& b) {
		if (lastDeal != b.lastDeal) return lastDeal < b.lastDeal;
		return pid < b.pid;
	}
};
//请求列标
unordered_map<int, Request> req;

Customer c[10];
Request r;

void GetRequest() {
	int id,index = 0;
	cin >> id >> r.cnt >> r.start >> r.take >> r.interval;
	r.lastDealTime = r.reqArrCnt = r.dealCnt = r.overCnt = 0;
	req[id] = r;
}

void GetCustom(int index) {
	cin >> c[index].pid >> c[index].k;
	int len = c[index].k,t = 0;
	c[index].pri.clear();
	for (int i = 0; i < len; ++i) {
		cin >> t;
		c[index].pri.emplace_back(t);
	}
	c[index].lastDeal = c[index].lastOver = c[index].lastid = 0;
}


//新的请求到达
void ReqArrive(int cur) {
	for (auto it = req.begin(); it != req.end(); ++it) {
		if(it->second.reqArrCnt >= it->second.cnt) continue;
		if (it->second.start <= cur){
			it->second.reqArrCnt++;
			it->second.start = cur + it->second.interval;
		}
	}
}

int main()
{
	int n, count = 0;
	while (cin >> n && n) {
		int cur = 0, m, tid;
		req.clear();

		for (int i = 0; i < n; ++i)
			GetRequest();

		cin >> m;
		for (int i = 0; i < m; ++i)
			GetCustom(i);

		while (!req.empty()) {

			ReqArrive(cur);

			for (int i = 0; i < m; ++i) {
				tid = c[i].lastid;
				if (tid) {
					if (c[i].lastOver > cur) continue;
					if (++req[tid].overCnt == req[tid].cnt) req.erase(tid);
					else req[tid].dealCnt--;
					c[i].lastid = 0;
				}
			}

			if(req.empty()) break;

			sort(c, c + m);

			for (int i = 0; i < m; ++i) {
				if (c[i].lastid) continue;
				for (int j = 0; j < c[i].pri.size(); ++j) {
					int tid = c[i].pri[j];
					if(req.count(tid) == 0) continue;
					if (req[tid].dealCnt + req[tid].overCnt >= req[tid].reqArrCnt)continue;
					c[i].lastid = tid;
					c[i].lastDeal = cur;
					c[i].lastOver = cur + req[tid].take;
					req[tid].dealCnt++;
					break;
				}
			}	
			++cur;
		}
		cout << "Scenario " << ++count << ": All requests are serviced within " << cur << " minutes." << endl;
	}
	
	return 0;
}