Problem1705--阳光长跑合格检测

1705: 阳光长跑合格检测

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MiB

Description

阳光长跑中,经常有同学想要偷懒,为了应对这一情况,现请你编写一个程序检测同学们的长跑有效性。数据库中存放着每一位同学打卡的记录,格式为:姓名,时间,打卡点。现在系统自动将每日打卡的记录转换成一个二维列表供大家使用,你需要将记录中符合长跑规范的同学筛选出来。
长跑规范:距离超过2km,时速不低于8km/h。
1号打卡点-2号打卡点=600m;1号打卡点-3号打卡点=700m;2号打卡点-3号打卡点=400m
例如:
系统提供的列表如下:

datas = [["小明",20,"1"],["小红",40,"1"],["小红",330,"3"],["小明",270,"2"],["小路",40,"1"],["小明",420,"3"],["小红",530,"2"],["小路",430,"3"],["小明",570,"2"],["小红",730,"1"],["小路",630,"2"],["小明",820,"1"],["小路",830,"3"],["小路",1230,"1"]]

提取小明的跑步轨迹:["小明",20,"1"]["小明",270,"2"]["小明",420,"3"]["小明",570,"2"]["小明",820,"1"] 共耗时800秒,路程1-2-3-2-1,共2000米,时速为9km/h 符合要求。

提取小红的跑步轨迹:["小红",40,"1"]["小红",330,"3"]["小红",530,"2"]["小红",730,"1"] 共耗时690秒,路程1-3-2-1,共1700米,时速为8.87km/h 不符合要求。

·········

综上所述,最终满足要求的学生名单如下:["小明"]

Input

输入一个二维列表datas

Output

输出一个列表,存放学生名字

Sample Input Copy

[["小明",20,"1"],["小红",40,"1"],["小红",330,"3"],["小明",270,"2"],["小路",40,"1"],["小明",420,"3"],["小红",530,"2"],["小路",430,"3"],["小明",570,"2"],["小红",730,"1"],["小路",630,"2"],["小明",820,"1"],["小路",830,"3"],["小路",1230,"1"]]

Sample Output Copy

['小明']

HINT

input函数无法读取列表数据,可以采用如下方法输入数据:
datas  =  eval(input())

Source/Category