【PAT甲级题解记录】1016 Phone Bills (25 分)
前言
Problem:1016 Phone Bills (25 分)
Tags:模拟
Difficulty:
剧情模式想流点汗想流点血死而无憾Address:1016 Phone Bills (25 分)
这题好难啊,很久没遇到那么搞心态的模拟了,有很大一部分是我读题的原因不是题的原因,但这题确实比较复杂,模拟题真的得读题、细心coding俩手抓了,最好打个框架草稿,对我来说称之为死而无憾难度不足为过。
问题描述
给定一些人的通话记录(有开始时间和结束时间构成),不同的时间段收费不一样,要求生成每个人的具体账单。
解题思路
思路每个人有每个人的想法,一般来说肯定要对名字和时间排序,就看大家习惯怎么保存数据怎么写了。
具体就说下坑点吧:
- 时间顺序必须处理好,不是每一个on和off都能对上的,只会取到按顺序相邻的on和off,其余皆省略。
- 通话会过夜,题目说在同一个月没说在同一天。
- 有些输入不能构成完整的通话,这个时候一定要注意不要不小心输出了一句话,什么都不输出就可以了。
参考代码
/*
* @Author: Retr0.Wu
* @Date: 2022-02-16 23:06:51
* @Last Modified by: Retr0.Wu
* @Last Modified time: 2022-02-17 01:44:25
* 通话时间的顺序处理上,我用pair其实不用赋值到另一个数组,直接判断前后关系可能更简单,不过都用pair数组了其实也差不多。
* 代码看着有点长,是因为我格式化了代码多了很多换行,还有一个主要原因就是过夜的情况我直接复制了几段,虽然不优雅,但是实用。
*/
#include <bits/stdc++.h>
using namespace std;
typedef struct Node
{
string name;
vector<pair<int, int> > times0;
vector<int> times;
bool operator<(const Node &node) const
{
return name < node.name;
}
int last;
} Node;
bool cmp(pair<int, int> a, pair<int, int> b)
{
return a.first < b.first;
}
int main()
{
vector<Node> nodes;
vector<double> prices(25);
double prices_in_oneday = 0;
for (int i = 0; i < 24; i++)
{
cin >> prices[i];
//prices[i] = prices[i] / 60;
prices_in_oneday += prices[i] * 60;
}
int N;
cin >> N;
int month;
int M, d, h, m;
while (N--)
{
string name, tp;
cin >> name;
scanf("%d:%d:%d:%d", &M, &d, &h, &m);
month = M;
cin >> tp;
int time = d * 24 * 60 + h * 60 + m;
int flag = 1;
for (int i = 0; i < nodes.size(); i++)
{
if (nodes[i].name == name)
{
nodes[i].times0.push_back(make_pair(time, tp == "on-line" ? 0 : 1));
flag = 0;
break;
}
}
if (flag)
{
Node tn;
tn.name = name;
tn.times0.push_back(make_pair(time, tp == "on-line" ? 0 : 1));
nodes.push_back(tn);
}
}
sort(nodes.begin(), nodes.end());
for (int i = 0; i < nodes.size(); i++)
{
sort(nodes[i].times0.begin(), nodes[i].times0.end(), cmp);
int pre = 1;
for(int j=0;j<nodes[i].times0.size();j++){
if(nodes[i].times0[j].second==1){
if(pre==1){
continue;
}
else{
nodes[i].times.push_back(nodes[i].times0[j].first);
pre = 1;
}
}
else{
if(pre==1){
nodes[i].times.push_back(nodes[i].times0[j].first);
pre = 0;
}
else{
nodes[i].times[nodes[i].times.size()-1] = nodes[i].times0[j].first;
}
}
}
if(nodes[i].times.size()>=2){
cout << nodes[i].name;
printf(" %02d\n", month);
}
double sum = 0;
for (int j = 1; j < nodes[i].times.size(); j += 2)
{
int time1 = nodes[i].times[j-1];
int time2 = nodes[i].times[j];
int d1 = time1 / (24 * 60);
int d2 = time2 / (24 * 60);
double price0 = 0;
//cout<<"d1="<<d1<<" d2="<<d2<<endl;
if (d1 == d2)
{
for (int k = 0; k < 24; k++)
{
int time11 = time1 % (24 * 60);
int time22 = time2 % (24 * 60);
int l = k * 60, r = (k + 1) * 60;
// cout<<"price = "<<prices[k]<<endl;
// printf("time11=%d time22=%d l=%d r=%d\n",time11,time22,l,r);
if (time11 >= r || time22 <= l)
{
continue;
}
else if (time11 <= l && time22 >= r)
{
price0 += prices[k] * 60;
}
else if(time11>=l&&time22<=r){
price0 += prices[k] * (time22-time11);
}
else if (time11 >= l)
{
price0 += prices[k] * (r - time11);
}
else
{
price0 += prices[k] * (time22 - r + 60);
}
}
}
else
{
price0 += prices_in_oneday * (d2 - d1 - 1);
for (int k = 0; k < 24; k++)
{
int time11 = time1 % (24 * 60);
int time22 = 24 * 60;
int l = k * 60, r = (k + 1) * 60;
if (time11 >= r || time22 <= l)
{
continue;
}
else if (time11 <= l && time22 >= r)
{
price0 += prices[k] * 60;
}
else if(time11>=l&&time22<=r){
price0 += prices[k] * (time22-time11);
}
else if (time11 >= l)
{
price0 += prices[k] * (r - time11);
}
else
{
price0 += prices[k] * (time22 - r + 60);
}
}
for (int k = 0; k < 24; k++)
{
int time11 = 0;
int time22 = time2 % (24 * 60);
int l = k * 60, r = (k + 1) * 60;
// cout<<"price = "<<prices[k]<<endl;
// printf("time11=%d time22=%d l=%d r=%d\n",time11,time22,l,r);
if (time11 >= r || time22 <= l)
{
continue;
}
else if (time11 <= l && time22 >= r)
{
price0 += prices[k] * 60;
}
else if(time11>=l&&time22<=r){
price0 += prices[k] * (time22-time11);
}
else if (time11 >= l)
{
price0 += prices[k] * (r - time11);
}
else
{
price0 += prices[k] * (time22 - r + 60);
}
}
}
sum += price0;
printf("%02d:%02d:%02d %02d:%02d:%02d %d $%.2f\n",
time1 / (24 * 60), time1 % (24 * 60) / 60, time1 % 60,
time2 / (24 * 60), time2 % (24 * 60) / 60, time2 % 60,
time2 - time1, price0 / 100);
}
if(sum>0){
printf("Total amount: $%.2f\n", sum / 100);
}
}
return 0;
}
总结
读题读题读题读题,不差点时间的,不然后期改代码真的会降智。