2113Snow Clearing

2113   Snow Clearing

题目描述

As the days become shorter and the nights become longer we turn our thoughts to snow clearing. Due to budget cuts, the Big Noisy City has exactly one snow plow. The plow can clear exactly one lane of a road in a single pass. Whenever there is snow on the ground, the plow departs from its hangar and tours the city, plowing as it goes. What is the minimum time that the plow needs to clear every lane of every road?

输入格式:

The first line of input contains two integers: the x,y coordinates of the hangar (in metres). Up to 100 lines follow. Each gives the coordinates (in metres) of the beginning and end of a street. All roads are perfectly straight, with one lane in each direction. The plow can turn any direction (including a U-turn) at any intersection, and can turn around at the end of any street. The plow travels at 20 km/h if it is plowing, and 50 km/h if the lane it is driving on has already been plowed. It is possible to reach all streets from the hangar.

输出格式:

Your output should be the time, in hours and minutes, required to clear the streets and return to the hangar. Round to the nearest minute.

输入样例 复制
0 0
0 0 10000 10000
5000 -10000 5000 10000
5000 10000 10000 10000
输出样例 复制
3:55

说明

2
4
通过提交
时空限制1000ms/128mb
题目来源
评测方式在线评测
题目类型
难        度