題意: 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;
}