HDOJ 1036 Average is not Fast Enough!

HDACM 1036

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
List<Team> list = new ArrayList<Team>();
int n = sc.nextInt();
double d = sc.nextDouble();
while (sc.hasNext()) {
Team t = new Team();
t.id = sc.nextInt();
t.times = new String
;
for (int i = 0; i < n; i++) {
t.times[i] = sc.next();
}
list.add(t);
}
for (int i = 0; i < list.size(); i++) {
Team t = list.get(i);
System.out.printf("%3d: ", t.id);
double time = 0;
boolean yes = true;
for (int j = 0; j < n; j++) {
String str = t.times[j];
String[] split = str.split(':' + "");
try {
time += Integer.valueOf(split[0]) * 60 + Integer.valueOf(split[1])
+ 1.0 * Integer.valueOf(split[2]) / 60;
} catch (NumberFormatException e) {
yes = false;
break;
}
}
if (!yes) {
System.out.println("-");
continue;
}
double ans = time / d;
int m = 0;
int s = 0;

m = (int)ans;
s = (int)((ans-m)*60+0.5);//四舍五入
if (s>=60) {
m++;
s = s-60;
}
System.out.printf("%d:%02d min/km",m,s);
System.out.println();
}
sc.close();
}
}

class Team {
int id;
String times[];

}