杭电oj HDOJ 1036 Average is not Fast Enough!

杭电oj HDOJ 1036 Average is not Fast Enough!

题目来源:http://acm.hdu.edu.cn/showproblem.php?pid=1036

Problem Description

A relay is a race for two or more teams of runners. Each member of a team runs one section of the race. Your task is to help to evaluate the results of a relay race.

You have to process several teams. For each team you are given a list with the running times for every section of the race. You are to compute the average time per kilometer over the whole distance. That’s easy, isn’t it?
So if you like the fun and challenge competing at this contest, perhaps you like a relay race, too. Students from Ulm participated e.g. at the “SOLA” relay in Zurich, Switzerland. For more information visit http://www.sola.asvz.ethz.ch/ after the contest is over.

Input

The first line of the input specifies the number of sections n followed by the total distance of the relay d in kilometers. You may safely assume that 1 <= n <= 20 and 0.0 < d < 200.0. Every following line gives information about one team: the team number t (an integer, right-justified in a field of width 3) is followed by the n results for each section, separated by a single space. These running times are given in the format “h:mm:ss” with integer numbers for the hours, minutes and seconds, respectively. In the special case of a runner being disqualified, the running time will be denoted by “-:–:--”. Finally, the data on every line is terminated by a newline character. Input is terminated by EOF.

Output

For each team output exactly one line giving the team’s number t right aligned in a field of width 3, and the average time for this team rounded to whole seconds in the format “m:ss”. If at least one of the team’s runners has been disqualified, output “-” instead. Adhere to the sample output for the exact format of presentation.

题目大意

测试用例给出分段路程所用的时间,要求计算总路程使用的平均时间

解题思路

利用“stringstream类”对所接收的字符串进行处理,分解出每个数据中的小时,分钟和秒钟。将他们累加起来求出路程全程的平均时间,在计算过程中要注意的是从小数四舍五入成整数的操作:在小数后加0.5然后对其取整

本人的C++解决方案

#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
using namespace std;

int main()
{
	int n, i, t, hour, min, sec, len, temp, res_min, res_sec;
	double d, res;
	string time, hour_temp, min_temp, sec_temp;
	stringstream ss;
	// 标记是否被取消成绩
	bool mark;
	cin >> n >> d;
	while (cin >> t) {
		// 初始化小时、分钟和秒钟以及标记
		hour = min = sec = 0;
		mark = true;
		for (i = 0; i < n; i++) {
			cin >> time;
			if (time.find('-') == string::npos) {
				len = time.length();
				// 计算小时数
				hour_temp = time.substr(0, 1);
				ss << hour_temp;
				ss >> temp;
				ss.clear();
				hour += temp;
				// 计算分钟数
				min_temp = time.substr(2, 2);
				ss << min_temp;
				ss >> temp;
				ss.clear();
				min += temp;
				// 计算秒钟数
				sec_temp = time.substr(5, 2);
				ss << sec_temp;
				ss >> temp;
				ss.clear();
				sec += temp;
			}
			// 被取消成绩
			else {
				mark = false;
			}
		}
		if (mark) {
			// 全程所使用的总秒数
			sec += hour * 3600 + min * 60; 
			// 平均每公里所有的秒数
			res = sec / d;
			res_min = int(res / 60);
			// 把小数四舍五入成整数:在小数后加0.5然后对其取整
			res_sec = int(res - res_min * 60 + 0.5);
			// 四舍五入后重新计算分钟和秒钟
			res_min += res_sec / 60;
			res_sec %= 60;
			if (res_sec < 10) {
				cout << setw(3) << t << ": " << res_min << ":0" << res_sec << " min/km" << endl;
			}
			else {
				cout << setw(3) << t << ": " << res_min << ":" << res_sec << " min/km" << endl;
			}
		}
		else {
			cout << setw(3) << t << ": -" << endl;
		}
	}
	return 0;
}

代码通过HDOJ平台运行通过,如发现错误,欢迎指出和纠正,谢谢!

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值