首页 > 专题系列 > Java解POJ > POJ 2565 Average is not Fast Enough! [解题报告] Java
2013
11-11

POJ 2565 Average is not Fast Enough! [解题报告] Java

Average is not Fast Enough!

问题描述 :

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.

输入:

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.

输出:

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.

样例输入:

2 12.5
  5 0:23:21 0:25:01
 42 0:23:32 -:--:--
  7 0:33:20 0:41:35

样例输出:

  5: 3:52 min/km
 42: -
  7: 6:00 min/km

解题代码:

//* @author  [email protected]
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
public class Main {
 public static void main(String[] args) throws IOException{
  // TODO Auto-generated method stub
  Scanner scan=new Scanner(System.in);
  BufferedReader stdin=new BufferedReader(new InputStreamReader(System.in));
  StringTokenizer tokens;
  tokens=new StringTokenizer(scan.nextLine());
  int n=new Integer(tokens.nextToken());
  double d=new Double(tokens.nextToken());
  double result;
  int num;
  String a="";
  int h,m,s;
  int i1,i2;
  int aux;
  while(scan.hasNext()){
	h=0;
	m=0;
	s=0;
	tokens=new StringTokenizer(scan.nextLine());
	num=new Integer(tokens.nextToken());
	for(int i=0;i< n;i++){
		a=tokens.nextToken();
		if(a.lastIndexOf('-')>=0) {
			h=-1;
			break;
		}
		i1=a.indexOf(':');
		i2=a.lastIndexOf(':');
		aux=new Integer(a.substring(0, i1));
		h+=aux;
		aux=new Integer(a.substring(i1+1,i2));
		m+=aux;
		s+=new Integer(a.substring(i2+1,a.length()));
	}
	if(h==-1) {
			a=num+"";
			for(int j=0;j< 3-a.length();j++) System.out.print(" ");
			System.out.print(num+": -\n");
	}
	else{
			result=h*3600+m*60+s;
			result=result/(d*60);
			m=(int)Math.floor(result);
			result=result-m;
			result*=60;
			s=(int)Math.round(result);
			if(s==60){
				s=0;
				m++;
			}
			a=num+"";
			for(int j=0;j< 3-a.length();j++) System.out.print(" ");
			a="";
			if(s< 10)a="0";
			System.out.print(num+": "+m+":"+a+s+" min/km\n");
	}
  }
 }
}

  1. 其实国内大部分公司对算法都不够重视。特别是中小型公司老板根本都不懂技术,也不懂什么是算法,从而也不要求程序员懂什么算法,做程序从来不考虑性能问题,只要页面能显示出来就是好程序,这是国内的现状,很无奈。