Day43: [PAT甲级] 1016 Phone Bills (25分)

Day43: [PAT甲级] 1016 Phone Bills (25分)

题源:

来自PAT甲级题库:

https://pintia.cn/problem-sets/994805342720868352/problems/994805493648703488

代码:

dirty code凑合看吧
因为把单词total写成了toltal,导致我折腾了一个小时不知道哪里错(笑哭)

#include<iostream>
#include<string>
#include<sstream>
#include<vector>
#include<map>
#include<cstdio>
#include<algorithm>
using namespace std;
double rate[24];
double hourMoney[25];
int N;
bool flag = false;
typedef struct record {
	string time;
	bool type;
}record;
map<string, vector<record> > m;
int s_int(string s) {
	stringstream ss;
	ss << s;
	int d;
	ss >> d;
	return d;
}
bool cmp(record A, record B) {
	if (A.time < B.time) return true;
	else return false;
}
double F(string on, string off) {
	double sum = 0;
	int sumMin = 0;
	int onDay = s_int(on.substr(0, 2));
	int onHour = s_int(on.substr(3, 2));
	int onMin = s_int(on.substr(6, 2));
	//cout << onDay << ":" << onHour << ":" << onMin << " ";
	int offDay = s_int(off.substr(0, 2));
	int offHour = s_int(off.substr(3, 2));
	int offMin = s_int(off.substr(6, 2));
	//cout << offDay << ":" << offHour << ":" << offMin <<endl;
	if (offDay > onDay) {
		//天
		sum += (offDay - onDay - 1)*hourMoney[24];
		sumMin += (offDay - onDay - 1) * 24 * 60;
		//小时
		for (int i = onHour + 1; i <= 23; i++) {
			sum += hourMoney[i];
			sumMin += 60;
		}
		for (int i = 0; i < offHour; i++) {
			sum += hourMoney[i];
			sumMin += 60;
		}
		//分钟
		sum += (60 - onMin)*rate[onHour];
		sumMin += 60 - onMin;
		sum += (offMin)*rate[offHour];
		sumMin += offMin;
	}
	else {
		for (int i = onHour + 1; i < offHour; i++) {
			sum += hourMoney[i];
			sumMin += 60;
		}
		//分钟
		if (offHour == onHour) {//同一个小时
			sum += (offMin - onMin)*rate[onHour];
			sumMin += offMin - onMin;
		}
		else {
			sum += (60 - onMin)*rate[onHour];
			sumMin += 60 - onMin;
			sum += (offMin)*rate[offHour];
			sumMin += offMin;
		}
		
	}
	sum = sum / 100.0;
	printf("%d $%.2lf\n", sumMin, sum);
	return sum;
}
int main() {
	for (int i = 0; i < 24; i++) {
		cin >> rate[i];
		hourMoney[i] = 60 * rate[i];
		hourMoney[24] += hourMoney[i];
	}

	cin >> N;
	for (int i = 0; i < N; i++) {
		record rec; string name, type;
		cin >> name >> rec.time >> type;
		if (type == "on-line") rec.type = true;
		else rec.type = false;

		if (m.find(name) == m.end()) {
			vector<record> v;
			v.push_back(rec);
			m[name] = v;
		}
		else {
			m[name].push_back(rec);
		}
	}
	for (auto iter = m.begin(); iter != m.end(); iter++) {
		flag = true;
		double Total = 0;
		
		string month = iter->second[0].time;
		vector<record> recs = iter->second;
		int size = recs.size();
		sort(recs.begin(), recs.end(), cmp);
		int left = -1;
		for (int i = 0; i < size; i++) {
			if (recs[i].type) {
				left = i;
			}
			else {
				if (left >= 0) {
					if (flag) {
						cout << iter->first << " ";
						cout << month[0] << month[1] << endl;
						flag = false;
					} 
					string on = recs[left].time, off = recs[i].time;
					on = on.substr(on.find(":", 0) + 1);
					off = off.substr(on.find(":", 0) + 1);
					cout << on << " " << off << " ";
					Total += F(on, off);
					left = -1;
				}
			}
		}
		if(flag==false) printf("Total amount: $%.2lf\n", Total);
	}
	system("pause");
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值